Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
From MaRDI portal
Publication:5470746
DOI10.1137/050645221zbMath1111.68136OpenAlexW1988782771MaRDI QIDQ5470746
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050645221
Related Items
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 ⋮ Price of asynchrony in mobile agents computing ⋮ Wait-Free Gathering Without Chirality ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ When patrolmen become corrupted: monitoring a graph using faulty mobile robots ⋮ Gathering asynchronous oblivious agents with local vision in regular bipartite graphs ⋮ Almost universal anonymous rendezvous in the plane ⋮ Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights ⋮ Gathering problems for autonomous mobile robots with lights ⋮ Gathering identical autonomous systems on a circle using stigmergy ⋮ Search on a Line by Byzantine Robots ⋮ Autonomous mobile robots with lights ⋮ Self-stabilizing gathering with strong multiplicity detection ⋮ Time optimal gathering of myopic robots on an infinite triangular grid ⋮ Rendezvous of Asynchronous Mobile Robots with Lights ⋮ Unnamed Item ⋮ How many oblivious robots can explore a line ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Team assembling problem for asynchronous heterogeneous mobile robots ⋮ Self-stabilizing gathering of mobile robots under crash or Byzantine faults ⋮ Gathering Asynchronous Robots in the Presence of Obstacles ⋮ Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity ⋮ Randomized gathering of asynchronous mobile robots ⋮ Computing by Mobile Robotic Sensors ⋮ Gathering of robots in a ring with mobile faults ⋮ Resilient Distributed Field Estimation ⋮ Leader election and gathering for asynchronous fat robots without common chirality ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ Arbitrary pattern formation by asynchronous, anonymous, oblivious robots ⋮ A unified approach for gathering and exclusive searching on rings under weak assumptions ⋮ Gathering asynchronous oblivious mobile robots in a ring ⋮ Mutual visibility by luminous robots without collisions ⋮ Remembering without memory: tree exploration by asynchronous oblivious robots ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ How to meet asynchronously at polynomial cost ⋮ Search on a line with faulty robots ⋮ Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement ⋮ Gathering in the plane of location-aware robots in the presence of spies ⋮ Rendezvous with constant memory ⋮ Stand up indulgent gathering ⋮ Stand up indulgent gathering ⋮ Wait-free approximate agreement on graphs ⋮ Wait-free approximate agreement on graphs ⋮ Fault-induced dynamics of oblivious robots on a line ⋮ Gathering anonymous, oblivious robots on a grid ⋮ Embedded pattern formation by asynchronous robots without chirality ⋮ Asynchronous approach in the plane: a deterministic polynomial algorithm ⋮ Deterministic rendezvous with different maps ⋮ Group search of the plane with faulty robots ⋮ On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis ⋮ Unnamed Item ⋮ Pattern Formation by Oblivious Asynchronous Mobile Robots ⋮ Rendezvous of Two Robots with Constant Memory ⋮ Deterministic polynomial approach in the plane ⋮ Forming sequences of geometric patterns with oblivious mobile robots ⋮ Anonymous meeting in networks
This page was built for publication: Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
