Efficient Dispersion of Mobile Agents without Global Knowledge
From MaRDI portal
Recommendations
- Collaborative dispersion by silent robots
- Almost uniform deployment of mobile agents in dynamic rings
- Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
- Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings
- Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings
Cited in
(18)- Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
- Dispersion of mobile robots on directed anonymous graphs
- Almost uniform deployment of mobile agents in dynamic rings
- Dispersion processes
- A note on dispersing particles on a line
- Memory optimal dispersion by anonymous mobile robots
- Collaborative dispersion by silent robots
- Fault-tolerant dispersion of mobile robots
- Distance-2-dispersion with termination by a strong team
- Efficient dispersion in triangular grids without prior knowledge
- Fault-tolerant dispersion of mobile robots
- Near-optimal dispersion on arbitrary anonymous graphs
- Near-linear time dispersion of mobile agents
- Balanced dispersion on time-varying dynamic graphs
- Self-stabilizing graph exploration by a single agent
- Optimal dispersion of silent robots in a ring
- Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots
- Memory optimal dispersion by anonymous mobile robots
This page was built for publication: Efficient Dispersion of Mobile Agents without Global Knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487916)
