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. [2] 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 perform some form of scattering, rather than point-convergence. In fact, we discover that they arrange themselves inside the segment delimited by the two faults in interleaved sequences of equidistant robots.
CITATION STYLE
De Carufel, J. L., & Flocchini, P. (2017). Fault-induced dynamics of oblivious robots on a line. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10616 LNCS, pp. 126–141). Springer Verlag. https://doi.org/10.1007/978-3-319-69084-1_9
Mendeley helps you to discover research relevant for your work.