Gathering of Mobile Robots Tolerating Multiple Crash Faults

International audienceWe 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