Gathering of Mobile Robots Tolerating Multiple Crash Faults

Abstract : We study distributed coordination among autonomous mobile robots, focusing on the problem of gathering the robots at a single location. The gathering problem has been solved previously using deterministic algorithms even for robots that are anonymous, oblivious, disoriented, and operate in the semi-synchronous ATOM model. However these solutions require all robots to be fault-free. The recent results of Agmon and Peleg [1] show how to gather all correct robots when one of the robots may crash permanently. We study gathering in n-robot systems with f crashes for any f
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-00930074
Contributor : Sébastien Tixeuil <>
Submitted on : Tuesday, January 14, 2014 - 11:50:43 AM
Last modification on : Tuesday, May 14, 2019 - 10:14:08 AM

Identifiers

Citation

Zohir Bouzid, Shantanu Das, Sébastien Tixeuil. Gathering of Mobile Robots Tolerating Multiple Crash Faults. International Conference on Distributed Computing Systems, Jul 2013, Philadelphia, United States. pp.337-346, ⟨10.1109/ICDCS.2013.27⟩. ⟨hal-00930074⟩

Share

Metrics

Record views

501