Optimal Byzantine-resilient convergence in uni-dimensional robot networks
From MaRDI portal
(Redirected from Publication:986551)
Recommendations
- Fault-tolerant gathering algorithms for autonomous mobile robots
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
- Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
- Algorithms – ESA 2004
Cites work
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Fault-tolerant gathering algorithms for autonomous mobile robots
- Gathering of asynchronous robots with limited visibility
- Optimal Byzantine-resilient convergence in uni-dimensional robot networks
- Reaching approximate agreement in the presence of faults
- Structural Information and Communication Complexity
- Structural Information and Communication Complexity
Cited in
(24)- On time complexity for connectivity-preserving scattering of mobile robots
- Approximate agreement under mobile Byzantine faults
- Search on a line with faulty robots
- Self-stabilizing gathering of mobile robots under crash or Byzantine faults
- Fault-induced dynamics of oblivious robots on a line
- Resilient consensus of second-order agent networks: asynchronous update rules with delays
- Resilient coordinated movement of connected autonomous vehicles
- Location functions for self-stabilizing Byzantine tolerant swarms
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Constrained distributed algebraic connectivity maximization in robotic networks
- Consensus of second-order multi-agent systems in the presence of locally bounded faults
- Stability and Convergence of a Message-Loss-Tolerant Rendezvous Algorithm for Wireless Networked Robot Systems
- 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*
- Fast multidimensional asymptotic and approximate consensus
- Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey
- Resilient consensus of high-order networks against collusive attacks
- Location Functions for Self-stabilizing Byzantine Tolerant Swarms
- Resilient distributed averaging: adversary detection and topological insights
- Compatibility of convergence algorithms for autonomous mobile robots
- Gathering on rings for myopic asynchronous robots with lights
- Computing the \(k\)-resilience of a synchronized multi-robot system
- Multidimensional agreement in Byzantine systems
- Optimal Byzantine-resilient convergence in uni-dimensional robot networks
This page was built for publication: Optimal Byzantine-resilient convergence in uni-dimensional robot networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q986551)
