Exploring unknown environments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Exploring unknown undirected graphs
Journal of Algorithms
The power of a pebble: exploring and mapping directed graphs
Information and Computation
Tree exploration with little memory
Journal of Algorithms
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
Journal of Graph Theory
Exploring an unknown graph efficiently
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Randomized rendezvous of mobile agents in anonymous unidirectional ring networks
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Price of asynchrony in mobile agents computing
Theoretical Computer Science
Hi-index | 0.00 |
We consider the exploration problem with a single agent in undirected graphs. Starting from an arbitrary node, the agent has to explore all the nodes and edges in the graph and return to the starting node. Our goal is to minimize both the number of agent moves and the memory space of the agent, which dominate the amount of communication during the exploration. In our setting, the agent is allowed to use the local memory called the whiteboard on each node (the whiteboard model), while most of existing exploration algorithms do not use the whiteboard (the no-whiteboard model). In the no-whiteboard model, the agent must memorize in its memory all information needed to explore the graph, and thus designing an exploration algorithm of small agent memory is difficult. In this paper, by allowing the agent to use whiteboards, we present four exploration algorithms such that both the number of agent moves and the agent memory space are small.