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… (More)