6 search results - page 1 / 2 » The cost of probabilistic agreement in oblivious robot netwo... |
IPL
2010
13 years 3 months ago
2010
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
ICDCN
2009
Springer
13 years 11 months ago
2009
Springer
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
SIROCCO
2007
13 years 6 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends ...
ICRA
2008
IEEE
13 years 11 months ago
2008
IEEE
—Simultaneous Localization And Mapping (SLAM) is one of the major challenges in mobile robotics. Probabilistic techniques using high-end range finding devices are well establishe...