Exploring Sparse Graphs with Advice (Extended Abstract)

Moving an autonomous agent through an unknown environment is one of the crucial problems for robotics and network analysis. Therefore, it received a lot of attention in the last decades and was analyzed in many different settings. The graph exploration problem is a theoretical and abstract model, where an algorithm has to decide how an agent, also called explorer, moves through a network with n vertices and m edges such that every point of interest is visited at least once. For its decisions, the knowledge of the algorithm is limited by the perception capacities of the explorer. We look at the fixed-graph scenario proposed by Kalyanasundaram and Pruhs (ICALP, 1993), where the explorer starts at a vertex of the network and sees all reachable vertices, their unique names and their distance from the current position.

[1]  Dennis Komm.  An Introduction to Online Computation: Determinism, Randomization, Advice , 2016 .

[2]  Robin R. Murphy,et al.  Artificial intelligence and mobile robots: case studies of successful robot systems , 1998 .

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

[4]  Pierre Fraigniaud,et al.  Digraphs Exploration with Little Memory , 2004, STACS.

[5]  Pierre Fraigniaud,et al.  Online computation with advice , 2011, Theor. Comput. Sci..

[6]  Krzysztof Diks,et al.  Tree exploration with little memory , 2002, SODA.

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

[8]  Roger Wattenhofer,et al.  Lower and upper competitive bounds for online directed graph exploration , 2016, Theor. Comput. Sci..

[9]  Kurt Mehlhorn,et al.  Online graph exploration: New results on old and new algorithms , 2012, Theor. Comput. Sci..

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

[11]  Bernard Mans,et al.  Network Exploration by Silent and Oblivious Robots , 2010, WG.

[12]  Baruch Schieber,et al.  Navigating in Unfamiliar Geometric Terrain , 1997, SIAM J. Comput..

[13]  Susanne Albers,et al.  Exploring Unknown Environments , 2000, SIAM J. Comput..

[14]  Dennis Komm,et al.  On the Advice Complexity of Online Problems , 2009, ISAAC.

[15]  Piotr Berman,et al.  On-line Searching and Navigation , 1996, Online Algorithms.

[16]  Andrzej Pelc,et al.  Tree exploration with advice , 2008, Inf. Comput..

[17]  Juraj Hromkovic,et al.  Information Complexity of Online Problems , 2010, MFCS.

[18]  Dennis Komm,et al.  Treasure Hunt with Advice , 2015, SIROCCO.

[19]  Hans-Joachim Böckenhauer,et al.  The Graph Exploration Problem with Advice , 2018, ArXiv.

[20]  Andrzej Pelc,et al.  Deterministic Graph Exploration with Advice , 2017, ICALP.

[21]  Stefan Dobrev,et al.  How Much Information about the Future Is Needed? , 2008, SOFSEM.

[22]  Nicola Santoro,et al.  Map construction of unknown graphs by multiple agents , 2007, Theor. Comput. Sci..

[23]  Sebastian Seibert,et al.  Advice Complexity of the Online Coloring Problem , 2013, CIAC.

[24]  Bala Kalyanasundaram,et al.  Constructing Competitive Tours from Local Information , 1993, Theor. Comput. Sci..

[25]  Wolfram Burgard,et al.  Autonomous exploration and mapping of abandoned mines , 2004, IEEE Robotics & Automation Magazine.

[26]  Euripides Markou,et al.  Online Graph Exploration with Advice , 2012, SIROCCO.

[27]  Sebastian Thrun,et al.  Robotic mapping: a survey , 2003 .

[28]  Ning Xu,et al.  Improved analysis of a multirobot graph exploration strategy , 2014, 2014 13th International Conference on Control Automation Robotics & Vision (ICARCV).