Polylogarithmic-overhead piecemeal graph exploration

We introduce a new traversal technique in the coxltext of piecemeal exploration of unknown graphs. The problem of learning a graph via piecemeal exploration requires a robot to create a complete map of its environment, subject to two constraints. First, it cannot jump between non-adjacent vertices in oue time step and second, it must return to a fixed starting point every so often. This paper presents the recursive piecemeal search (RPS) strategy together with an algorithm for the above problem. We are able to achieve O(log’n) overhead (where ‘n is the number of vertices), improving 011 previous results of Awerbuch, Betke, Rive& and Singh which require O(n’) overhead. The graph is discovered via the recursive piecerneal search, which can be viewed as a combination of breadthfirst and depth-first passes. The construction of FLPS trees relies on the concept of sparse neighborhood covers aud captures nicely the nature of the graph exploration problem.