Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Distributed Algorithms
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science
Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
SIAM Journal on Computing
Deterministic Rendezvous in Graphs
Algorithmica
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Asynchronous deterministic rendezvous in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Polynomial deterministic rendezvous in arbitrary graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On the feasibility of gathering by autonomous mobile robots
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Uniform multi-agent deployment on a ring
Theoretical Computer Science
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Rendezvous of mobile agents in unknown graphs with faulty links
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
We consider the problem of gathering identical, memoryless, mobile robots in one node of an anonymous unoriented ring. Robots start from different nodes of the ring. They operate in Look-Compute-Move cycles and have to end up in the same node. In one cycle, a robot takes a snapshot of the current configuration (Look), makes a decision to stay idle or to move to one of its adjacent nodes (Compute), and in the latter case makes an instantaneous move to this neighbor (Move). Cycles are performed asynchronously for each robot. For an odd number of robots we prove that gathering is feasible if and only if the initial configuration is not periodic, and we provide a gathering algorithm for any such configuration. For an even number of robots we decide feasibility of gathering except for one type of symmetric initial configurations, and provide gathering algorithms for initial configurations proved to be gatherable.