Fault-Induced Dynamics of Oblivious Robots on a Line
Jean-Lou De Carufel, Paola Flocchini

TL;DR
This paper explores how a group of oblivious robots on a line behave unexpectedly when some are faulty and execute a standard convergence algorithm, revealing a hierarchical scattering pattern induced by faults.
Contribution
It introduces the first analysis of fault-induced dynamics in oblivious robots, showing how faults cause scattering and hierarchical organization instead of convergence.
Findings
Faults cause robots to scatter rather than converge.
Robots form interleaved equidistant sequences within the fault segment.
Hierarchical grouping emerges based on convergence levels.
Abstract
The study of computing in presence of faulty robots in the Look-Compute-Move model has been the object of extensive investigation, typically with the goal of designing algorithms tolerant to as many faults as possible. In this paper, we initiate a new line of investigation on the presence of faults, focusing on a rather different issue. We are interested in understanding the dynamics of a group of robots when they execute an algorithm designed for a fault-free environment, in presence of some undetectable crashed robots. We start this investigation focusing on the classic point-convergence algorithm by Ando et al. for robots with limited visibility, in a simple setting (which already presents serious challenges): the robots operate fully synchronously on a line, and at most two of them are faulty. Interestingly, and perhaps surprisingly, the presence of faults induces the robots to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
