Back to Search
Start Over
Stand up indulgent gathering.
- Source :
-
Theoretical Computer Science . Jan2023, Vol. 939, p63-77. 15p. - Publication Year :
- 2023
-
Abstract
- We consider a swarm of mobile robots evolving in a bidimensional Euclidean space. We study a variant of the crash-tolerant gathering problem: if no robot crashes, robots have to meet at the same arbitrary location, not known beforehand, in finite time; if one or several robots crash at the same location, the remaining correct robots gather at the crash location to rescue them. Motivated by impossibility results in the semi-synchronous setting, we present the first solution to the problem for the fully synchronous setting that operates in the vanilla Look-Compute-Move model with no additional hypotheses: robots are oblivious, disoriented, have no multiplicity detection capacity, and may start from arbitrary positions (including those with multiplicity points). We furthermore show that robots gather in a time that is proportional to the initial maximum distance between robots. [ABSTRACT FROM AUTHOR]
- Subjects :
- *MOBILE robots
*ROBOTS
Subjects
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 939
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 160210333
- Full Text :
- https://doi.org/10.1016/j.tcs.2022.10.015