Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
From MaRDI portal
Publication:3524293
DOI10.1007/11864219_4zbMATH Open1155.68535OpenAlexW1515418527MaRDI QIDQ3524293FDOQ3524293
Authors: Xavier Défago, Maria Gradinariu, Stéphane Messika, Philippe Raïpin Parvédy 
Publication date: 9 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11864219_4
Recommendations
- Self-stabilizing gathering of mobile robots under crash or Byzantine faults
- Fault-tolerant gathering algorithms for autonomous mobile robots
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Distributed computing by mobile robots: gathering
- Structural Information and Communication Complexity
Cited In (42)
- Availability Studies and Solutions for Wheeled Mobile Robots
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Optimum Gathering of Asynchronous Robots
- Optimal Byzantine-resilient convergence in uni-dimensional robot networks
- Self-stabilizing gathering with strong multiplicity detection
- Structural Information and Communication Complexity
- Distributed algorithms for partitioning a swarm of autonomous mobile robots
- Computing by mobile robotic sensors
- Search on a line with faulty robots
- The cost of probabilistic agreement in oblivious robot networks
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- Rendezvous with constant memory
- On asynchronous rendezvous in general graphs
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
- Byzantine gathering in networks
- \(k\)-circle formation by disoriented asynchronous robots
- LATIN 2004: Theoretical Informatics
- Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Stand up indulgent gathering
- Byzantine gathering in polynomial time
- A fault-tolerant communication mechanism for cooperative robots
- Gathering Asynchronous Robots in the Presence of Obstacles
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Rendezvous of Two Robots with Constant Memory
- Autonomous mobile robots with lights
- Stand up indulgent gathering
- Collisionless gathering of robots with an extent
- Self-deployment of mobile sensors on a ring
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots
- Gathering on a circle with limited visibility by anonymous oblivious robots
- Gathering on a circle with limited visibility by anonymous oblivious robots
- Optimal rendezvous on a line by location-aware robots in the presence of spies*
- Fault-induced dynamics of oblivious robots on a line
- Title not available (Why is that?)
- Meeting in a polygon by anonymous oblivious robots
- Self-stabilizing gathering of mobile robots under crash or Byzantine faults
- Title not available (Why is that?)
- Asynchronous approach in the plane: a deterministic polynomial algorithm
This page was built for publication: Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524293)
