Two Convergence Problems for Robots on Graphs

The class of robot convergence tasks has been shown to capture fundamental aspects of fault-tolerant computability. A set of asynchronous robots that may fail by crashing, start from unknown places in some given space, and have to move towards positions close to each other. In this article, we study the case where the space is uni-dimensional, modeled as a graph G. In graph convergence, robots have to end up on one or two vertices of the same edge. We consider also a variant of robot convergence on graphs, edge covering, where additionally it is required that not all robots end up on the same vertex. Remarkably, these two similar problems have very different computability properties, related to orthogonal fundamental issues of distributed computations: agreement and symmetry breaking. We characterize the graphs on which each of these problems is solvable, and give optimal time algorithms for the solvable cases. Although the results can be derived from known general topology theorems, the presentation serves as a self-contained introduction to the topology approach to distributed computing, and yields concrete algorithms and impossibility results.

[1]  Soma Chaudhuri,et al.  More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems , 1993, Inf. Comput..

[2]  Vijay Kumar,et al.  Invariants for homology classes with application to optimal search and planning problem in robotics , 2012, Annals of Mathematics and Artificial Intelligence.

[3]  Michel Raynal,et al.  The renaming problem in shared memory systems: An introduction , 2011, Comput. Sci. Rev..

[4]  Noa Agmon,et al.  Fault-tolerant gathering algorithms for autonomous mobile robots , 2004, SODA '04.

[5]  Maurice Herlihy,et al.  The topological structure of asynchronous computability , 1999, JACM.

[6]  Nir Shavit,et al.  Toward a Topological Characterization of Asynchronous Complexity , 2006, SIAM J. Comput..

[7]  Sergio Rajsbaum,et al.  New combinatorial topology bounds for renaming: The upper bound , 2012, JACM.

[8]  Hagit Attiya,et al.  Renaming in an asynchronous environment , 1990, JACM.

[9]  Marcin Paprzycki,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..

[10]  Maurice Herlihy,et al.  A classification of wait-free loop agreement tasks , 2003, Theor. Comput. Sci..

[11]  Maurice Herlihy,et al.  The Relative Power of Composite Loop Agreement Tasks , 2015, OPODIS.

[12]  Sébastien Tixeuil,et al.  Gathering of Mobile Robots Tolerating Multiple Crash Faults , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.

[13]  Nicola Santoro,et al.  Autonomous mobile robots with lights , 2016, Theor. Comput. Sci..

[14]  M. Herlihy,et al.  Computing in the Presence of Concurrent Solo Executions , 2014, LATIN.

[15]  Maurice Herlihy,et al.  The decidability of distributed decision tasks (extended abstract) , 1997, STOC '97.

[16]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

[17]  Zhiwei Xu,et al.  Classifying rendezvous tasks of arbitrary dimension , 2009, Theor. Comput. Sci..

[18]  Maurice Herlihy,et al.  Distributed Computing Through Combinatorial Topology , 2013 .

[19]  Shmuel Zaks,et al.  A Combinatorial Characterization of the Distributed 1-Solvable Tasks , 1990, J. Algorithms.

[20]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[21]  Nancy A. Lynch,et al.  The BG distributed simulation algorithm , 2001, Distributed Computing.

[22]  Michel Raynal,et al.  Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects , 2016, SIAM J. Comput..

[23]  Eli Gafni,et al.  Recursion in Distributed Computing , 2010, SSS.

[24]  Maurice Herlihy,et al.  Multidimensional agreement in Byzantine systems , 2014, Distributed Computing.

[25]  Nancy A. Lynch,et al.  Reaching approximate agreement in the presence of faults , 1986, JACM.

[26]  Maurice Herlihy,et al.  Subconsensus Tasks: Renaming Is Weaker Than Set Agreement , 2006, DISC.

[27]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .