TY - JOUR

T1 - Optimal constrained graph exploration

AU - Duncan, Christian A.

AU - Kobourov, Stephen G.

AU - Kumar, V. S.Anil

N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.

PY - 2006

Y1 - 2006

N2 - 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, for example, it cannot jump between nonadjacent nodes. 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. In the second variation, a fuel tank of limited capacity forces the robot to return to s after traversing C edges. The efficiency of algorithms for both variations of the problem is measured by the number of edges traversed during the exploration. We present an algorithm for a tethered robot that explores the graph in Θ(|E|) edge traversals. The problem of exploration using a robot with a limited fuel tank capacity can be solved with a simple reduction from the tethered robot case and also yields a Θ(|E|) algorithm. This improves on the previous best-known bound of O (|E|+ |V| log 2 |V|). Since the lower bound for the graph exploration problems is Ω(|E|), our algorithm is optimal within a constant factor.

AB - 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, for example, it cannot jump between nonadjacent nodes. 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. In the second variation, a fuel tank of limited capacity forces the robot to return to s after traversing C edges. The efficiency of algorithms for both variations of the problem is measured by the number of edges traversed during the exploration. We present an algorithm for a tethered robot that explores the graph in Θ(|E|) edge traversals. The problem of exploration using a robot with a limited fuel tank capacity can be solved with a simple reduction from the tethered robot case and also yields a Θ(|E|) algorithm. This improves on the previous best-known bound of O (|E|+ |V| log 2 |V|). Since the lower bound for the graph exploration problems is Ω(|E|), our algorithm is optimal within a constant factor.

KW - Computational learning theory

KW - Graph exploration

UR - http://www.scopus.com/inward/record.url?scp=33749000268&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749000268&partnerID=8YFLogxK

U2 - 10.1145/1159892.1159897

DO - 10.1145/1159892.1159897

M3 - Article

AN - SCOPUS:33749000268

VL - 2

SP - 380

EP - 402

JO - ACM Transactions on Algorithms

JF - ACM Transactions on Algorithms

SN - 1549-6325

IS - 3

ER -