A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is
Optimal constrained graph exploration
ACM Transactions on Algorithms
We address the problem of constrained exploration of an unknown graph G = (V, E) from a given start node s with either a tethered robot or a robot with a fuel tank of limited capacity, the former being a tighter constraint. In both variations of the problem, the robot can only move along the edges of the graph, i.e, it cannot jump between non-adjacent vertices. In the tethered robot case, if the tether (rope) has length l, then the robot must remain within distance l from the start node s. Indoi:10.1145/1159892.1159897 fatcat:aoa3gtmcfbhgrosf4jgfzhgasy