Scatter of robots

DOI10.1142/S0129626409000146MaRDI QIDQ6483528zbMATH OpenFDO

Authors Yoann Dieudonné, Franck Petit

Publication date 29 September 2010

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129626409000146

zbMATH Keywords

distributed algorithmsstabilizationmobile robot networks

Mathematics Subject Classification ID

Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 2038783
• The random bit complexity of mobile robots scattering
• The cost of probabilistic agreement in oblivious robot networks
• Distributed computing by mobile robots: gathering
• Robots and Demons (The Code of the Origins)

Cited in

(8)

• Minimum algorithm sizes for the gathering and related problems of autonomous mobile robots
• The random bit complexity of mobile robots scattering
• The cost of probabilistic agreement in oblivious robot networks
• The minimum algorithm size of k-grouping by silent oblivious robots
• On time complexity for connectivity-preserving scattering of mobile robots
• Self-stabilizing mobile medical robots scattering algorithm
• Robots and Demons (The Code of the Origins)
• Uniform scattering of autonomous mobile robots in a grid

This page was built for publication: Scatter of robots

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