Dispersion of mobile robots on directed anonymous graphs
From MaRDI portal
Publication:2097347
DOI10.1007/978-3-031-09993-9_11OpenAlexW4285183905MaRDI QIDQ2097347
Gokarna Sharma, Debasish Pattanayak, Giuseppe F. Italiano
Publication date: 11 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-09993-9_11
dispersiondirected graphsmobile robotsmulti-agent systemslocal and 1-hop communicationtime and memory complexity
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Cites Work
- Unnamed Item
- Unnamed Item
- Lower and upper competitive bounds for online directed graph exploration
- Uniform multi-agent deployment on a ring
- Dispersion of mobile robots on grids
- Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
- Dispersion of mobile robots: the power of randomness
- Fast collaborative graph exploration
- Time and space optimality of rotor-router graph exploration
- Graph exploration by a finite automaton
- UNIFORM SCATTERING OF AUTONOMOUS MOBILE ROBOTS IN A GRID
- Distributed Computing by Mobile Robots: Gathering
- Collective tree exploration
- Euler Tour Lock-In Problem in the Rotor-Router Model
- Label-guided graph exploration by a finite automaton
- Uniform Deployment of Mobile Agents in Asynchronous Rings
- Computing by Mobile Robotic Sensors
