Dispersion of mobile robots: the power of randomness

DOI10.1007/978-3-030-14812-6_30MaRDI QIDQ2327501zbMATH OpenOpenAlexFDO

Authors Anisur Rahaman Molla, William K. jun. Moses

Publication date 15 October 2019

Full work available at URL https://arxiv.org/abs/1902.10489

zbMATH Keywords

collective robot explorationdispersiondistributed algorithmsload balancingmobile robotsnature-inspired computingrandomized algorithmsscatteringuniform deployment

Mathematics Subject Classification ID

Recommendations

• Fast dispersion of mobile robots on arbitrary graphs
• Collaborative dispersion by silent robots
• Dispersion of mobile robots on grids
• Near-optimal dispersion on arbitrary anonymous graphs

Cited in

(16)

• Dispersion of mobile robots on directed anonymous graphs
• Almost uniform deployment of mobile agents in dynamic rings
• Memory optimal dispersion by anonymous mobile robots
• Collaborative dispersion by silent robots
• Fault-tolerant dispersion of mobile robots
• How Do Mobile Agents Benefit from Randomness?
• Fast dispersion of mobile robots on arbitrary graphs
• Distance-2-dispersion with termination by a strong team
• 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
• Optimal dispersion of silent robots in a ring
• Dispersion of mobile robots on grids
• 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: Dispersion of mobile robots: the power of randomness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2327501)