Impact of topographic information on graph exploration efficiency

A robot has to explore an undirected connected graph by visiting all its nodes and traversing all edges. It may either have a complete a priori knowledge of the graph or only have an unoriented map of it, or, finally, lack any knowledge of the graph. We study the impact of this varying amount of knowledge on exploration performance. It is shown that the best exploration algorithm lacking any knowledge of the graph uses twice as many edge traversals in the worst case as does the best algorithm which has an unoriented map of the graph. On the other hand, the latter uses twice as many edge traversals in the worst case as does the best algorithm having a complete knowledge of the graph. Similar results for the restricted case of exploration algorithms working only for trees are also established. © 2000 John Wiley & Sons, Inc.

[1]  Mona Singh,et al.  Piecemeal learning of an unknown environment , 1995, Mach. Learn..

[2]  Rolf Klein,et al.  A competitive strategy for learning a polygon , 1997, SODA '97.

[3]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[4]  S. Sitharama Iyengar,et al.  Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms , 1993 .

[5]  Amos Fiat,et al.  Randomized robot navigation algorithms , 1996, SODA '96.

[6]  Susanne Albers,et al.  Exploring unknown environments , 1997, STOC '97.

[7]  Andrzej Pelc,et al.  Exploring unknown undirected graphs , 1999, SODA '98.

[8]  Nicola Santoro.  Sense of direction, topological awareness and communication complexity , 1984, SIGA.

[9]  Krzysztof Diks,et al.  Perfect Broadcasting in Unlabeled Networks , 1998, Discret. Appl. Math..

[10]  Baruch Schieber,et al.  Navigating in unfamiliar geometric terrain , 1991, STOC '91.

[11]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[12]  Krzysztof Diks,et al.  Broadcasting in Unlabeled Tori , 1998, Parallel Process. Lett..

[13]  Krzysztof Diks,et al.  Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages , 1998, Inf. Process. Lett..

[14]  Amos Fiat,et al.  On-Line Navigation in a Room , 1992, SODA.

[15]  Xiaotie Deng,et al.  How to learn an unknown environment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[16]  Xiaotie Deng,et al.  Exploring an unknown graph , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.