ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
Theoretical Computer Science
On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Computing without communicating: ring exploration by asynchronous oblivious robots
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Exclusive perpetual ring exploration without chirality
DISC'10 Proceedings of the 24th international conference on Distributed computing
Optimal exploration of small rings
Proceedings of the Third International Workshop on Reliability, Availability, and Security
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Optimal probabilistic ring exploration by semi-synchronous oblivious robots
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Optimal deterministic ring exploration with oblivious asynchronous robots
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Brief announcement: discovering and assessing fine-grained metrics in robot networks protocols
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 0.00 |
In this paper, we investigate the exclusive perpetual exploration of grid shaped networks using anonymous, oblivious and fully asynchronous robots. Our results hold for robots without sense of direction (i.e. they do not agree on a common North, nor do they agree on a common left and right ; furthermore, the "North" and "left" of each robot is decided by an adversary that schedules robots for execution, and may change between invocations of particular robots). We focus on the minimal number of robots that are necessary and sufficient to solve the problem in general grids. In more details, we prove that three deterministic robots are necessary and sufficient, provided that the size of the grid is n ×m with 3≤n≤m or n=2 and m≥4. Perhaps surprisingly, and unlike results for the exploration with stop problem (where grids are "easier" to explore and stop than rings with respect to the number of robots), exclusive perpetual exploration requires as many robots in the ring as in the grid. Furthermore, we propose a classification of configurations such that the space of configurations to be checked is drastically reduced. This pre-processing lays the bases for the automated verification of our algorithm for general grids as it permits to avoid combinatorial explosion.