Inference of finite automata using homing sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Introduction to algorithms
Navigating in unfamiliar geometric terrain
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Theoretical Computer Science
How to learn an unknown environment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Piecemeal learning of an unknown environment
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Exploring unknown environments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Polylogarithmic-overhead piecemeal graph exploration
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Randomized robot navigation algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A competitive strategy for learning a polygon
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Piecemeal graph exploration by a mobile robot
Information and Computation
Exploring unknown undirected graphs
Journal of Algorithms
Tree exploration with little memory
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal Graph Exploration without Good Maps
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Can we elect if we cannot compare?
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Tree exploration with little memory
Journal of Algorithms
Optimal graph exploration without good maps
Theoretical Computer Science
Graph exploration by a finite automaton
Theoretical Computer Science - Mathematical foundations of computer science 2004
Optimal constrained graph exploration
ACM Transactions on Algorithms (TALG)
Tree exploration with logarithmic memory
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Fast periodic graph exploration with constant memory
Journal of Computer and System Sciences
Note: Setting port numbers for fast graph exploration
Theoretical Computer Science
Impact of memory size on graph exploration capability
Discrete Applied Mathematics
Information and Computation
Remembering without memory: Tree exploration by asynchronous oblivious robots
Theoretical Computer Science
Fast periodic graph exploration with constant memory
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Computing without communicating: ring exploration by asynchronous oblivious robots
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Setting port numbers for fast graph exploration
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Tree exploration with an oracle
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Finding short right-hand-on-the-wall walks in graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Deterministic network exploration by a single agent with Byzantine tokens
Information Processing Letters
Deterministic network exploration by anonymous silent agents with local traffic reports
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
We address the problem of exploring 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. 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 which explores the graph in &Ogr;(¦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 &Ogr;(¦E¦) algorithm. This improves on the previous best known bound of &Ogr;(¦E¦ + ¦V¦log 2¦V¦) in [4]. Since the lower bound for the graph exploration problems is ¦E¦, our algorithm is optimal, thus answering the open problem of Awerbuch, Betke, Rivest, and Singh [3].