30 search results - page 5 / 6 » Optimal Deterministic Protocols for Mobile Robots on a Grid |
SIROCCO
2007
13 years 9 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
ALGOSENSORS
2008
Springer
13 years 9 months ago
2008
Springer
We consider the problem of uniformly dispersing mobile robotic sensors in a simply connected orthogonal space of unknown shape. The mobile sensors are injected into the space from ...
ICDCN
2009
Springer
14 years 2 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, ...
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— To autonomously navigate on rough terrain is a challenging problem for mobile robots, requiring the ability to decide whether parts of the environment can be traversed ...