Uniform scattering of autonomous mobile robots in a grid
From MaRDI portal
Publication:2997927
DOI10.1142/S0129054111008295zbMATH Open1211.68445MaRDI QIDQ2997927FDOQ2997927
Authors: Eduardo Mesa Barrameda, Lali Barrière, P. Flocchini, N. Santoro 
Publication date: 10 May 2011
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Title not available (Why is that?)
- Self-deployment of mobile sensors on a ring
- Local spreading algorithms for autonomous robot systems
- Title not available (Why is that?)
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
Cited In (16)
- Almost uniform deployment of mobile agents in dynamic rings
- Performance analysis of grid architecture via queueing theory
- Optimal deterministic protocols for mobile robots on a grid
- The random bit complexity of mobile robots scattering
- Computing by mobile robotic sensors
- Collaborative dispersion by silent robots
- Leader election and shape formation with self-organizing programmable matter
- Fast Uniform Scattering on a Grid for Asynchronous Oblivious Robots
- Dispersion of mobile robots on directed anonymous graphs
- Efficient live exploration of a dynamic ring with mobile robots
- A point set connection problem for autonomous mobile robots in a grid
- Self-stabilizing mobile medical robots scattering algorithm
- Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings
- Uniform Dispersal of Robots with Minimum Visibility Range
- Cellular automata and wireless sensor networks
- Optimal deterministic protocols for mobile robots on a grid
This page was built for publication: Uniform scattering of autonomous mobile robots in a grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2997927)
