Back to Search
Start Over
Stand Up Indulgent Gathering
- Source :
- ALGOSENSORS 2021, ALGOSENSORS 2021, Aug 2021, Lisbon, Portugal. pp.17-28, ⟨10.1007/978-3-030-89240-1_2⟩, Algorithms for Sensor Systems ISBN: 9783030892395, ALGOSENSORS, Theoretical Computer Science, Theoretical Computer Science, 2023, 939, pp.63-77. ⟨10.1016/j.tcs.2022.10.015⟩
- Publication Year :
- 2023
- Publisher :
- HAL CCSD, 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.<br />Comment: arXiv admin note: substantial text overlap with arXiv:2010.04400
- Subjects :
- FOS: Computer and information sciences
Theoretical computer science
General Computer Science
gathering
Computer science
[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Crash
0102 computer and information sciences
[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
01 natural sciences
Theoretical Computer Science
Computer Science::Robotics
010309 optics
0103 physical sciences
Mobile robots
[INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO]
Computer Science - Multiagent Systems
Impossibility
Euclidean space
Swarm behaviour
Mobile robot
Mobile robots gathering fault-tolerance
fault-tolerance
Computer Science - Distributed, Parallel, and Cluster Computing
010201 computation theory & mathematics
[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]
Robot
Distributed, Parallel, and Cluster Computing (cs.DC)
Finite time
[INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
crash faults
Multiagent Systems (cs.MA)
Subjects
Details
- Language :
- English
- ISBN :
- 978-3-030-89239-5
- ISSN :
- 18792294 and 03043975
- ISBNs :
- 9783030892395
- Database :
- OpenAIRE
- Journal :
- ALGOSENSORS 2021, ALGOSENSORS 2021, Aug 2021, Lisbon, Portugal. pp.17-28, ⟨10.1007/978-3-030-89240-1_2⟩, Algorithms for Sensor Systems ISBN: 9783030892395, ALGOSENSORS, Theoretical Computer Science, Theoretical Computer Science, 2023, 939, pp.63-77. ⟨10.1016/j.tcs.2022.10.015⟩
- Accession number :
- edsair.doi.dedup.....b8a30807059aaf530cf9193ff5e30a74