The cost of probabilistic agreement in oblivious robot networks

DOI10.1016/J.IPL.2010.04.006MaRDI QIDQ656601zbMATH OpenOpenAlexFDO

Authors Xavier Défago, Maria Potop-Butucaru, Taisuke Izumi, Stéphane Messika, Julien Clément

Publication date 18 January 2012

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

Full work available at URL https://doi.org/10.1016/j.ipl.2010.04.006

zbMATH Keywords

distributed computinganalysis of algorithmsrandomized algorithmsdistributed systemsdesign of algorithms

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Self-stabilizing gathering of mobile robots under crash or Byzantine faults
• Distributed computing by mobile robots: gathering
• Scatter of robots
• The random bit complexity of mobile robots scattering

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Hybrid I/O automata.
• Markov Chains
• Robots and Demons (The Code of the Origins)

Cited in

(7)

• On the self-stabilization of mobile oblivious robots in uniform rings
• Self-stabilizing gathering with strong multiplicity detection
• The random bit complexity of mobile robots scattering
• On time complexity for connectivity-preserving scattering of mobile robots
• Self-stabilizing mobile medical robots scattering algorithm
• Scatter of robots
• Computing on rings by oblivious robots: a unified approach for different tasks

This page was built for publication: The cost of probabilistic agreement in oblivious robot networks

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