Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
From MaRDI portal
Recommendations
- Fault-tolerant gathering algorithms for autonomous mobile robots
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Self-stabilizing gathering of mobile robots under crash or Byzantine faults
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
Cited in
(83)- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
- Deterministic polynomial approach in the plane
- Anonymous meeting in networks
- Group search of the plane with faulty robots
- Gathering anonymous, oblivious robots on a grid
- Optimal Byzantine-resilient convergence in uni-dimensional robot networks
- Self-stabilizing gathering with strong multiplicity detection
- The topology of look-compute-move robot wait-free algorithms with hard termination
- Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Oracle-based flocking of mobile robots in crash-recovery model
- Gathering of robots in a ring with mobile faults
- Use of information, memory and randomization in asynchronous gathering
- Gathering in the plane of location-aware robots in the presence of spies
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Search on a line with faulty robots
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- 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
- Almost universal anonymous rendezvous in the plane
- Time optimal gathering of myopic robots on an infinite triangular grid
- Gathering despite mischief
- 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
- Wait-free gathering without chirality
- How many oblivious robots can explore a line
- Fault-tolerant gathering algorithms for autonomous mobile robots
- Pattern formation by oblivious asynchronous mobile robots
- Price of asynchrony in mobile agents computing
- Leader election and gathering for asynchronous fat robots without common chirality
- The minimum algorithm size of k-grouping by silent oblivious robots
- On the computational power of energy-constrained mobile robots
- k-circle formation by disoriented asynchronous robots
- On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- Forming sequences of geometric patterns with oblivious mobile robots
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Byzantine gathering in polynomial time
- Stand up indulgent gathering
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Stand-up indulgent gathering on lines
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Universal pattern formation by oblivious robots under sequential schedulers
- Resilient distributed field estimation
- Autonomous mobile robots with lights
- Gathering semi-synchronously scheduled two-state robots
- Gathering asynchronous oblivious mobile robots in a ring
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
- Stand up indulgent gathering
- Wait-free approximate agreement on graphs
- Wait-free approximate agreement on graphs
- Gathering identical autonomous systems on a circle using stigmergy
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots
- Time optimal gathering of myopic robots on an infinite triangular grid
- Embedded pattern formation by asynchronous robots without chirality
- Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
- scientific article; zbMATH DE number 7561452 (Why is no real title available?)
- Gathering problems for autonomous mobile robots with lights
- Gathering on a circle with limited visibility by anonymous oblivious robots
- Gathering on a circle with limited visibility by anonymous oblivious robots
- Optimal gathering of robots in anonymous butterfly networks via leader election
- Optimal rendezvous on a line by location-aware robots in the presence of spies*
- Randomized gathering of asynchronous mobile robots
- Fault-induced dynamics of oblivious robots on a line
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Deterministic rendezvous with different maps
- Want to gather? No need to chatter!
- Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights
- Team assembling problem for asynchronous heterogeneous mobile robots
- Rendezvous of Asynchronous Mobile Robots with Lights
- Search on a Line by Byzantine Robots
- Evacuation of equilateral triangles by mobile agents of limited communication range
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- Deterministic gathering with crash faults
- Self-stabilizing gathering of mobile robots under crash or Byzantine faults
- On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis
- Asynchronous approach in the plane: a deterministic polynomial algorithm
- Mutual visibility by luminous robots without collisions
This page was built for publication: Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470746)
