Self-stabilizing gathering of mobile robots under crash or Byzantine faults
DOI10.1007/S00446-019-00359-XzbMath1460.68015OpenAlexW2965788437WikidataQ127393381 ScholiaQ127393381MaRDI QIDQ2204778
Philippe Raïpin Parvédy, Maria Gradinariu Potop-Butucaru, Xavier Défago
Publication date: 16 October 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-019-00359-x
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Artificial intelligence for robotics (68T40)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Self-stabilizing gathering with strong multiplicity detection
- Gathering of asynchronous robots with limited visibility
- Optimal Byzantine-resilient convergence in uni-dimensional robot networks
- Hybrid I/O automata.
- Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Optimum Gathering of Asynchronous Robots
- Wait-Free Gathering Without Chirality
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Reaching approximate agreement in the presence of faults
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Structural Information and Communication Complexity
- Synchronous gathering without multiplicity detection: a certified algorithm
This page was built for publication: Self-stabilizing gathering of mobile robots under crash or Byzantine faults
