Fault-tolerant dispersion of mobile robots
From MaRDI portal
Publication:6174434
DOI10.1007/978-3-031-25211-2_3arXiv2211.12451OpenAlexW4318023066MaRDI QIDQ6174434
No author found.
Publication date: 17 August 2023
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.12451
dispersionmobile robotfault-tolerant algorithmdistributed algorithmround complexitymemory complexitycrash-fault
Related Items (1)
Cites Work
- Dispersion of mobile robots on grids
- Memory optimal dispersion by anonymous mobile robots
- Live exploration with mobile robots in a dynamic ring (revisited)
- Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
- Dispersion of mobile robots: the power of randomness
- Graph exploration by a finite automaton
- Euler Tour Lock-In Problem in the Rotor-Router Model
- Label-guided graph exploration by a finite automaton
- Fast Collaborative Graph Exploration
- Gathering in dynamic rings
- Fault-tolerant dispersion of mobile robots
This page was built for publication: Fault-tolerant dispersion of mobile robots
