Dispersion of mobile robots: the power of randomness
From MaRDI portal
Publication:2327501
DOI10.1007/978-3-030-14812-6_30OpenAlexW2934894069MaRDI QIDQ2327501
William K. jun. Moses, Anisur Rahaman Molla
Publication date: 15 October 2019
Full work available at URL: https://arxiv.org/abs/1902.10489
scatteringdispersionload balancingrandomized algorithmsdistributed algorithmsmobile robotsuniform deploymentnature-inspired computingcollective robot exploration
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots ⋮ Memory optimal dispersion by anonymous mobile robots ⋮ Collaborative dispersion by silent robots ⋮ Fault-tolerant dispersion of mobile robots ⋮ Memory optimal dispersion by anonymous mobile robots ⋮ Dispersion of mobile robots on directed anonymous graphs ⋮ Almost uniform deployment of mobile agents in dynamic rings
This page was built for publication: Dispersion of mobile robots: the power of randomness