Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Piecemeal graph exploration by a mobile robot
Information and Computation
Optimal deterministic protocols for mobile robots on a grid
Information and Computation
Graph exploration by a finite automaton
Theoretical Computer Science - Mathematical foundations of computer science 2004
Collision prevention using group communication for asynchronous cooperative mobile robots
AINA '07 Proceedings of the 21st International Conference on Advanced Networking and Applications
Anonymous graph exploration without collision by mobile robots
Information Processing Letters
Computing without communicating: ring exploration by asynchronous oblivious robots
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Setting port numbers for fast graph exploration
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Finding short right-hand-on-the-wall walks in graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Space lower bounds for graph exploration via reduced automata
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Exclusive perpetual ring exploration without chirality
DISC'10 Proceedings of the 24th international conference on Distributed computing
Asynchronous exclusive perpetual grid exploration without sense of direction
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Optimal grid exploration by asynchronous oblivious robots
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
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 |
Given an arbitrary partial anonymous grid (a finite grid with possibly missing vertices or edges), this paper focuses on the exploration of such a grid by a set of mobile anonymous agents (called robots). Assuming that the robots can move synchronously, but cannot communicate with each other, the aim is to design an algorithm executed by each robot that allows, as many robots as possible (let k be this maximal number), to visit infinitely often all the vertices of the grid, in such a way that no vertex hosts more than one robot at a time, and each edge is traversed by at most one robot at a time. The paper addresses this problem by considering a central parameter, denoted ρ , that captures the view of each robot. More precisely, it is assumed that each robot sees the part of the grid (and its current occupation by other robots, if any) centered at the vertex it currently occupies and delimited by the radius ρ . Based on such a radius notion, a previous work has investigated the cases ρ = 0 and ρ = + ***, and shown that, while there is no solution for ρ = 0, k ≤ p *** q is a necessary and sufficient requirement when ρ = + ***, where p is the number of vertices of the grid, and q a parameter whose value depends on the actual topology of the partial grid. This paper completes our previous results by addressing the more difficult case, namely ρ = 1. It shows that k ≤ p *** 1 when q = 0, and k ≤ p *** q otherwise, is a necessary and sufficient requirement for solving the problem. More generally, the paper shows that this case is the borderline from which the considered problem can be solved.