Fault-Tolerant and Self-stabilizing Mobile Robots Gathering

DOI10.1007/11864219_4zbMath1155.68535OpenAlexW1515418527MaRDI QIDQ3524293

Maria Gradinariu, Philippe Raïpin Parvédy, Stephane Messika, Xavier Défago

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

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Related Items (34)

TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications ⋮ Byzantine gathering in networks ⋮ On asynchronous rendezvous in general graphs ⋮ Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults ⋮ \(k\)-circle formation by disoriented asynchronous robots ⋮ Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement ⋮ Optimal rendezvous on a line by location-aware robots in the presence of spies* ⋮ Byzantine gathering in polynomial time ⋮ When patrolmen become corrupted: monitoring a graph using faulty mobile robots ⋮ Pushing lines helps: efficient universal centralised transformations for programmable matter ⋮ Autonomous mobile robots with lights ⋮ Self-stabilizing gathering with strong multiplicity detection ⋮ Unnamed Item ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Self-stabilizing gathering of mobile robots under crash or Byzantine faults ⋮ Meeting in a polygon by anonymous oblivious robots ⋮ Optimum Gathering of Asynchronous Robots ⋮ Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings ⋮ Gathering Asynchronous Robots in the Presence of Obstacles ⋮ The cost of probabilistic agreement in oblivious robot networks ⋮ Computing by Mobile Robotic Sensors ⋮ Self-deployment of mobile sensors on a ring ⋮ Arbitrary pattern formation by asynchronous, anonymous, oblivious robots ⋮ Search on a line with faulty robots ⋮ Optimal Byzantine-resilient convergence in uni-dimensional robot networks ⋮ Unnamed Item ⋮ Rendezvous with constant memory ⋮ Collisionless Gathering of Robots with an Extent ⋮ Stand up indulgent gathering ⋮ Stand up indulgent gathering ⋮ Distributed algorithms for partitioning a swarm of autonomous mobile robots ⋮ Fault-induced dynamics of oblivious robots on a line ⋮ Asynchronous approach in the plane: a deterministic polynomial algorithm ⋮ Rendezvous of Two Robots with Constant Memory

This page was built for publication: Fault-Tolerant and Self-stabilizing Mobile Robots Gathering