The cost of probabilistic agreement in oblivious robot networks

DOI10.1016/J.IPL.2010.04.006zbMATH Open1229.68006OpenAlexW2113586464MaRDI QIDQ656601FDOQ656601

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

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

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)

Cites Work

• Markov Chains
• Title not available (Why is that?)
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Hybrid I/O automata.
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Robots and Demons (The Code of the Origins)

Cited In (7)

• On the self-stabilization of mobile oblivious robots in uniform rings
• The random bit complexity of mobile robots scattering
• Self-stabilizing gathering with strong multiplicity detection
• 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)