Why Robots Need Maps

A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) and finally return to the initial position. The graph is not known in advance (an online setting) and robots have to traverse an edge in order to discover new parts (edges) of the graph. The team can locally exchange information, using wireless communication devices. We compare a cost of the online and optimal offline algorithm which knows the graph beforehand (competitive ratio). If the cost is the total time of an exploration, we prove the lower bound of Ω(log k/ log log k) for competitive ratio of any deterministic algorithm (using global communication). This significantly improves the best known constant lower bound. For the cost being the maximal number of edges traversed by a robot (the energy) we present an improved (4- 2/k)-competitive online algorithm for trees.

[1]  Libor Preucil,et al.  European Robotics Symposium 2008 , 2008 .

[2]  Ichiro Suzuki,et al.  Distributed algorithms for formation of geometric patterns with many mobile robots , 1996, J. Field Robotics.

[3]  Andrzej Pelc,et al.  Collective tree exploration , 2004, Networks.

[4]  Andrzej Pelc,et al.  Deterministic Rendezvous in Graphs , 2003, ESA.

[5]  Jean-Daniel Boissonnat,et al.  Algorithmic Foundations of Robotics V, Selected Contributions of the Fifth International Workshop on the Algorithmic Foundations of Robotics, WAFR 2002, Nice, France, December 15-17, 2002 , 2004, WAFR.

[6]  Rudolf Fleischer,et al.  Exploring an Unknown Graph Efficiently , 2005, ESA.

[7]  Esther M. Arkin,et al.  Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments , 2002, WAFR.

[8]  R. Rivest,et al.  Piecemeal Learning of an Unknown Environment , 1993, COLT '93.

[9]  Nicola Santoro,et al.  Distributed Exploration of an Unknown Graph , 2005, SIROCCO.

[10]  Christian Schindelhauer,et al.  Power-Aware Collective Tree Exploration , 2006, ARCS.

[11]  Andrzej Pelc,et al.  Optimal graph exploration without good maps , 2002, Theor. Comput. Sci..

[12]  Michael A. Bender,et al.  The power of a pebble: exploring and mapping directed graphs , 1998, STOC '98.

[13]  Michael A. Bender,et al.  The power of team exploration: two robots can learn unlabeled directed graphs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[14]  Rastislav Královič,et al.  Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings , 2006, MFCS.

[15]  Nicola Santoro,et al.  Searching for a black hole in arbitrary networks: optimal mobile agent protocols , 2002, PODC '02.

[16]  Friedhelm Meyer auf der Heide,et al.  Smart Robot Teams Exploring Sparse Trees , 2006, MFCS.

[17]  Nicola Santoro,et al.  Black hole search in common interconnection networks , 2006, Networks.

[18]  Klaus Waldschmidt,et al.  Architecture of Computing Systems - ARCS 2006 , 2006, Lecture Notes in Computer Science.

[19]  Andrzej Pelc,et al.  Tree exploration with logarithmic memory , 2007, SODA '07.

[20]  Stefano Leonardi,et al.  Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, ESA.