On the power of bounded asynchrony: convergence by autonomous robots with limited visibility

DOI10.1007/S00446-024-00463-7MaRDI QIDQ6601211FDOQ6601211

Authors: David Kirkpatrick, Irina Kostitsyna, Alfredo Navarra, G. Prencipe, N. Santoro 

Publication date: 10 September 2024

Published in: Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

mobile robotsasynchronous computationdistributed geometric algorithms

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cites Work

• A new approach for analyzing convergence algorithms for mobile robots
• Distributed computing by mobile robots: gathering
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• Gathering of asynchronous robots with limited visibility
• Characterizing geometric patterns formable by oblivious anonymous mobile robots
• Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
• Gathering few fat mobile robots in the plane
• Impossibility of gathering by a set of autonomous mobile robots
• Leader election and gathering for asynchronous fat robots without common chirality
• The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
• Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
• The optimal tolerance of uniform observation error for mobile robot convergence
• A distributed algorithm for gathering many fat mobile robots in the plane
• The gathering problem for two oblivious robots with unreliable compasses
• Forming sequences of geometric patterns with oblivious mobile robots
• Getting close without touching: near-gathering for autonomous mobile robots
• Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
• Embedded pattern formation by asynchronous robots without chirality
• Asynchronous arbitrary pattern formation: the effects of a rigorous approach
• Brief announcement: Pattern formation problem for synchronous mobile robots in the three dimensional Euclidean space
• Distributed computing by mobile robots: uniform circle formation
• Pattern formation by mobile robots with limited visibility
• Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
• Self-stabilizing gathering of mobile robots under crash or Byzantine faults
• Separating Bounded and Unbounded Asynchrony for Autonomous Robots

This page was built for publication: On the power of bounded asynchrony: convergence by autonomous robots with limited visibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601211)