Optimal Byzantine-resilient convergence in uni-dimensional robot networks

DOI10.1016/j.tcs.2010.05.006zbMath1196.68282OpenAlexW2006833310MaRDI QIDQ986551

Zohir Bouzid, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil

Publication date: 11 August 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.006

zbMATH Keywords

distributed algorithmsself-stabilizationByzantine toleranceoblivious robot networks

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Related Items (17)

Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults ⋮ Optimal rendezvous on a line by location-aware robots in the presence of spies* ⋮ On time complexity for connectivity-preserving scattering of mobile robots ⋮ Resilient consensus of second-order agent networks: asynchronous update rules with delays ⋮ Resilient coordinated movement of connected autonomous vehicles ⋮ Optimal probabilistic ring exploration by semi-synchronous oblivious robots ⋮ Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey ⋮ Resilient consensus of high-order networks against collusive attacks ⋮ Multidimensional agreement in Byzantine systems ⋮ Self-stabilizing gathering of mobile robots under crash or Byzantine faults ⋮ Location functions for self-stabilizing Byzantine tolerant swarms ⋮ Consensus of second-order multi-agent systems in the presence of locally bounded faults ⋮ Approximate agreement under mobile Byzantine faults ⋮ Search on a line with faulty robots ⋮ Optimal Byzantine-resilient convergence in uni-dimensional robot networks ⋮ Fault-induced dynamics of oblivious robots on a line ⋮ Fast Multidimensional Asymptotic and Approximate Consensus

Cites Work

• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• Optimal Byzantine-resilient convergence in uni-dimensional robot networks
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Reaching approximate agreement in the presence of faults
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Structural Information and Communication Complexity
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Structural Information and Communication Complexity

This page was built for publication: Optimal Byzantine-resilient convergence in uni-dimensional robot networks