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
Liste complète des métadonnées
Contributeur : Sébastien Tixeuil <>
Soumis le : mardi 14 janvier 2014 - 11:50:43
Dernière modification le : jeudi 22 novembre 2018 - 14:40:47



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. IEEE, pp.337-346, 2013, 〈10.1109/ICDCS.2013.27〉. 〈hal-00930074〉



Consultations de la notice