Skip to Main content Skip to Navigation
Reports

How to gather asynchronous oblivious robots on anonymous rings

Abstract : A set of robots arbitrarily placed on the nodes of an anonymous graph have to meet at one common node and remain in there. This problem is known in the literature as the \emph{gathering}. Robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), decides whether to stay idle or to move to one of its neighbors (Compute), and in the latter case makes the computed move instantaneously (Move). Cycles are performed asynchronously for each robot. Moreover, each robot is empowered by the so called \emph{multiplicity detection} capability, that is, a robot is able to detect during its Look operation whether a node is empty, or occupied by one robot, or occupied by an undefined number of robots greater than one. The described problem has been extensively studied during the last years. However, the known solutions work only for specific initial configurations and leave some open cases. In this paper, we provide an algorithm which solves the general problem, and is able to detect all the non-gatherable configurations. It is worth noting that our new algorithm makes use of a unified and general strategy for any initial configuration.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-00697132
Contributor : Gianlorenzo d'Angelo <>
Submitted on : Monday, May 14, 2012 - 3:54:05 PM
Last modification on : Wednesday, October 14, 2020 - 4:23:57 AM
Long-term archiving on: : Thursday, December 15, 2016 - 7:15:08 AM

File

RR-7963.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00697132, version 1

Collections

Citation

Gianlorenzo d'Angelo, Gabriele Di Stefano, Alfredo Navarra. How to gather asynchronous oblivious robots on anonymous rings. [Research Report] RR-7963, INRIA. 2012, pp.24. ⟨hal-00697132⟩

Share

Metrics

Record views

589

Files downloads

331