Introduction to algorithms
Theoretical Computer Science
Inference of finite automata using homing sequences
Information and Computation
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Piecemeal Learning of an Unknown Environment
Machine Learning - Special issue on COLT '93
A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
Discrete Applied Mathematics
Navigating in Unfamiliar Geometric Terrain
SIAM Journal on Computing
(p-1)/(p+1)-approximate algorithms for p-traveling salemen problems on a tree with minmax objective
Discrete Applied Mathematics
How to learn an unknown environment. I: the rectilinear case
Journal of the ACM (JACM)
Polylogarithmic-overhead piecemeal graph exploration
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Near-Linear Time Construction of Sparse Neighborhood Covers
SIAM Journal on Computing
Randomized robot navigation algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Piecemeal graph exploration by a mobile robot
Information and Computation
Exploring unknown undirected graphs
Journal of Algorithms
Exploring Unknown Environments
SIAM Journal on Computing
An Online Algorithm for Improving Performance in Navigation
SIAM Journal on Computing
Optimal constrained graph exploration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The Polygon Exploration Problem
SIAM Journal on Computing
The power of a pebble: exploring and mapping directed graphs
Information and Computation
Journal of Graph Theory
Memory Efficient Anonymous Graph Exploration
Graph-Theoretic Concepts in Computer Science
Multi-robot tree and graph exploration
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Tree exploration with logarithmic memory
ACM Transactions on Algorithms (TALG)
Online graph exploration: new results on old and new algorithms
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
More efficient periodic traversal in anonymous undirected graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Collaborative search on the plane without communication
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Finding patterns in an unknown graph
AI Communications - The Symposium on Combinatorial Search
Online graph exploration: New results on old and new algorithms
Theoretical Computer Science
Fast collaborative graph exploration
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 0.00 |
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|log2|V|). Since the lower bound for the graph exploration problems is Ω(|E|), our algorithm is optimal within a constant factor.