Piecemeal graph exploration by a mobile robot.
From MaRDI portal
Publication:1854296
DOI10.1006/inco.1999.2795zbMath1045.68611OpenAlexW1989793404MaRDI QIDQ1854296
Baruch Awerbuch, Margrit Betke, Mona Singh, Ronald L. Rivest
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1999.2795
Related Items
Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots ⋮ Memory Efficient Anonymous Graph Exploration ⋮ Collaborative Exploration by Energy-Constrained Mobile Robots ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ Online graph exploration: New results on old and new algorithms ⋮ On a simple depth-first search strategy for exploring unknown graphs ⋮ Efficient live exploration of a dynamic ring with mobile robots ⋮ Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs ⋮ Impact of knowledge on the cost of treasure hunt in trees ⋮ On the Power of Local Orientations ⋮ Unnamed Item ⋮ Deterministic treasure hunt and rendezvous in arbitrary connected graphs ⋮ Exploration of Faulty Hamiltonian Graphs ⋮ Deterministic network exploration by a single agent with Byzantine tokens ⋮ Searching for a black hole in arbitrary networks: optimal mobile agents protocols ⋮ Simple agents learn to find their way: an introduction on mapping polygons ⋮ Building a nest by an automaton ⋮ Fast periodic graph exploration with constant memory ⋮ Collaborative delivery on a fixed path with homogeneous energy-constrained agents ⋮ Impact of memory size on graph exploration capability ⋮ Online Graph Exploration: New Results on Old and New Algorithms ⋮ Fastest motion planning for an unmanned vehicle in the presence of accelerating obstacles ⋮ Tree exploration with advice ⋮ Gossiping by energy-constrained mobile agents in tree networks ⋮ Remembering without memory: tree exploration by asynchronous oblivious robots ⋮ Unnamed Item ⋮ Anonymous graph exploration without collision by mobile robots ⋮ Collaborative exploration of trees by energy-constrained mobile robots ⋮ A general lower bound for collaborative tree exploration ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Collaborative delivery with energy-constrained mobile robots ⋮ Near-gathering of energy-constrained mobile agents ⋮ More Efficient Periodic Traversal in Anonymous Undirected Graphs ⋮ Graph exploration by a finite automaton ⋮ The power of a pebble: Exploring and mapping directed graphs ⋮ Fast collaborative graph exploration ⋮ Performance bounds for planning in unknown terrain ⋮ Convergecast and broadcast by power-aware mobile agents
Cites Work
- Unnamed Item
- Shortest paths without a map
- Walking an unknown street with bounded detour
- Inference of finite automata using homing sequences
- A new distributed algorithm to find breadth first search trees
- How to learn an unknown environment. I
- Online Navigation in a Room
- Navigating in Unfamiliar Geometric Terrain
