Anonymous graph exploration without collision by mobile robots
From MaRDI portal
Publication:975538
DOI10.1016/j.ipl.2008.08.011zbMath1191.68709OpenAlexW2048090017MaRDI QIDQ975538
Michel Raynal, François Bonnet, Alessia Milani, Roberto Baldoni
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00250153/file/PI-1886.pdf
Related Items
Lower and upper competitive bounds for online directed graph exploration, Collision-free network exploration, Grid exploration by a swarm of autonomous robots with minimum repetitions, Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality, Efficient live exploration of a dynamic ring with mobile robots, Uniform multi-agent deployment on a ring, Optimal torus exploration by oblivious robots, Computing on rings by oblivious robots: a unified approach for different tasks
Cites Work
- Automaten in planaren Graphen
- Piecemeal graph exploration by a mobile robot.
- Optimal deterministic protocols for mobile robots on a grid
- Graph exploration by a finite automaton
- Setting Port Numbers for Fast Graph Exploration
- Automata and Labyrinths
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Impact of topographic information on graph exploration efficiency
- Exploring Unknown Environments
- Fast Periodic Graph Exploration with Constant Memory
- Structural Information and Communication Complexity
- Structural Information and Communication Complexity
