Tree exploration with little memory
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Collaborative Exploration of Unknown Environments with Teams of Mobile Robots
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
Lifelong Planning for Mobile Robots
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
Optimal Graph Exploration without Good Maps
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Approximate sequencing for variable length tasks
Theoretical Computer Science
Performance bounds for planning in unknown terrain
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case
Programming and Computing Software
Irredundant Algorithms for Traversing Directed Graphs: The Nondeterministic Case
Programming and Computing Software
Tree exploration with little memory
Journal of Algorithms
Traversal of an Unknown Directed Graph by a Finite Robot
Programming and Computing Software
Optimal graph exploration without good maps
Theoretical Computer Science
Graph exploration by a finite automaton
Theoretical Computer Science - Mathematical foundations of computer science 2004
Broadcast in the rendezvous model
Information and Computation
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
Map construction of unknown graphs by multiple agents
Theoretical Computer Science
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
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Information and Computation
Anonymous graph exploration without collision by mobile robots
Information Processing Letters
Memory Efficient Anonymous Graph Exploration
Graph-Theoretic Concepts in Computer Science
Weighted nearest neighbor algorithms for the graph exploration problem on cycles
Information Processing Letters
Exploration of Periodically Varying Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Multi-robot tree and graph exploration
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Broadcast in the rendezvous model
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
Experimental studies of graph traversal algorithms
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Computing without communicating: ring exploration by asynchronous oblivious robots
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Rendezvous of mobile agents in directed graphs
DISC'10 Proceedings of the 24th international conference on Distributed computing
DISC'10 Proceedings of the 24th international conference on Distributed computing
Optimal map construction of an unknown torus
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Constructing a map of an anonymous graph: applications of universal sequences
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Predicting the labels of an unknown graph via adaptive exploration
Theoretical Computer Science
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
Improved distributed exploration of anonymous networks
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Setting port numbers for fast graph exploration
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Exploring an unknown graph efficiently
ESA'05 Proceedings of the 13th annual European conference on Algorithms
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
Optimal exploration of terrains with obstacles
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Finding short right-hand-on-the-wall walks in graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
More efficient periodic traversal in anonymous undirected graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Deterministic network exploration by a single agent with Byzantine tokens
Information Processing Letters
Decidability classes for mobile agents computing
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
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
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
Online graph exploration: New results on old and new algorithms
Theoretical Computer Science
On the exploration of time-varying networks
Theoretical Computer Science
Collecting information by power-aware mobile agents
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Memory lower bounds for randomized collaborative search and implications for biology
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Hi-index | 0.01 |
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connected graph. The robot's task is to visit all nodes and edges of the graph using the minimum number R of edge traversals. Deng and Papadimitriou [ Proceedings of the 31st Symposium on the Foundations of Computer Science, 1990, pp. 356--361] showed an upper bound for R of dO(d) m and Koutsoupias (reported by Deng and Papadimitriou) gave a lower bound of $\Omega(d^2 m)$, where m is the number of edges in the graph and d is the minimum number of edges that have to be added to make the graph Eulerian. We give the first subexponential algorithm for this exploration problem, which achieves an upper bound of dO(log d) m. We also show a matching lower bound of $d^{\Omega(\log d)}m$ for our algorithm. Additionally, we give lower bounds of $2^{\Omega(d)}m$, respectively, $d^{\Omega(\log d)}m$ for various other natural exploration algorithms.