The Random Bit Complexity of Mobile Robots Scattering

DOI10.1142/S0129054117500083zbMath1368.68220arXiv1309.6603MaRDI QIDQ4977890

Sébastien Tixeuil, Quentin Bramas

Publication date: 17 August 2017

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

scatteringrandomized algorithmmobile robotsrandom bits complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Artificial intelligence for robotics (68T40)

Related Items (3)

TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications ⋮ Randomized gathering of asynchronous mobile robots ⋮ Unnamed Item

Cites Work

• The cost of probabilistic agreement in oblivious robot networks
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Robots and Demons (The Code of the Origins)

This page was built for publication: The Random Bit Complexity of Mobile Robots Scattering