Learning regular sets from queries and counterexamples
Information and Computation
Theoretical Computer Science
Information and Computation
Diversity-based inference of finite automata
Journal of the ACM (JACM)
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
Piecemeal graph exploration by a mobile robot (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Robot navigation with range queries
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Navigating in Unfamiliar Geometric Terrain
SIAM Journal on Computing
Exactly Learning Automata of Small Cover Time
Machine Learning - Special issue on the eighth annual conference on computational learning theory, (COLT '95)
Exploring unknown environments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Efficient learning of typical finite automata from random walks
Information and Computation
How to learn an unknown environment. I: the rectilinear case
Journal of the ACM (JACM)
The power of a pebble: exploring and mapping directed graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
Exploring unknown undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Efficient algorithms for learning to play repeated games against computationally bounded adversaries
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Improved approximation algorithms for the freeze-tag problem
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Graph exploration by a finite automaton
Theoretical Computer Science - Mathematical foundations of computer science 2004
Oracle size: a new measure of difficulty for communication tasks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Optimal constrained graph exploration
ACM Transactions on Algorithms (TALG)
Fast periodic graph exploration with constant memory
Journal of Computer and System Sciences
Trade-offs between the size of advice and broadcasting time in trees
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Note: Setting port numbers for fast graph exploration
Theoretical Computer Science
Impact of memory size on graph exploration capability
Discrete Applied Mathematics
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Information and Computation
Memory Efficient Anonymous Graph Exploration
Graph-Theoretic Concepts in Computer Science
Theoretical Computer Science
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Robustness of the Rotor-router Mechanism
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Exploration of Periodically Varying Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Fast periodic graph exploration with constant memory
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Communication algorithms with advice
Journal of Computer and System Sciences
DISC'10 Proceedings of the 24th international conference on Distributed computing
Time optimal algorithms for black hole search in rings
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
An agent exploration in unknown undirected graphs with whiteboards
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Setting port numbers for fast graph exploration
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Journal of Parallel and Distributed Computing
Tree exploration with an oracle
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Space lower bounds for graph exploration via reduced automata
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
The reduced automata technique for graph exploration space lower bounds
Theoretical Computer Science
More efficient periodic traversal in anonymous undirected graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Online multi-robot exploration of grid graphs with rectangular obstacles
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Collaborative search on the plane without communication
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
On the exploration of time-varying networks
Theoretical Computer Science
Exploring an unknown dangerous graph using tokens
Theoretical Computer Science
Hi-index | 0.01 |
Exploring and mapping an unknown environment is a fundamental problem that is studied in a variety of contexts. Many results have focused on finding efficient solutions to restricted versions of the problem. In this paper, we consider a model that makes very limited assumptions about the environment and solve the mapping problem in this general setting. We model the environment by an unknown directed graph G, and consider the problem of a robot exploring and mapping G. The edges emanating from each vertex are numbered from '1' to 'd', but we do not assume that the vertices of G are labeled. Since the robot has no way of distinguishing between vertices, it has no hope of succeeding unless it is given some means of distinguishing between vertices. For this reason we provide the robot with a "pebble'--a device that it can place on a vertex and use to identify the vertex later. In this paper we show: (1) If the robot knows an upper bound on the number of vertices then it can learn the graph efficiently with only one pebble. (2) If the robot does not know an upper bound on the number of vertices n, then Θ(log log n) pebbles are both necessary and sufficient. In both cases our algorithms are deterministic.