Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
From MaRDI portal
(Redirected from Publication:3524293)
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
(44)- Availability Studies and Solutions for Wheeled Mobile Robots
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- Optimum Gathering of Asynchronous Robots
- Optimal Byzantine-resilient convergence in uni-dimensional robot networks
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Self-stabilizing gathering with strong multiplicity detection
- Distributed algorithms for partitioning a swarm of autonomous mobile robots
- Structural Information and Communication Complexity
- The cost of probabilistic agreement in oblivious robot networks
- Search on a line with faulty robots
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- Computing by mobile robotic sensors
- Gathering asynchronous robots in the presence of obstacles
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- On asynchronous rendezvous in general graphs
- Rendezvous of two robots with constant memory
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Rendezvous with constant memory
- Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
- Byzantine gathering in polynomial time
- Fault-tolerant gathering algorithms for autonomous mobile robots
- k-circle formation by disoriented asynchronous robots
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- LATIN 2004: Theoretical Informatics
- Byzantine gathering in polynomial time
- Stand up indulgent gathering
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- A fault-tolerant communication mechanism for cooperative robots
- Fault detection and identification by swarms of autonomous mobile robots
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Autonomous mobile robots with lights
- Stand up indulgent gathering
- Self-deployment of mobile sensors on a ring
- Collisionless gathering of robots with an extent
- 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
- Meeting in a polygon by anonymous oblivious robots
- Self-stabilizing gathering of mobile robots under crash or Byzantine faults
- 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)
