On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
From MaRDI portal
Publication:6601211
DOI10.1007/S00446-024-00463-7MaRDI QIDQ6601211
Irina Kostitsyna, David Kirkpatrick, Alfredo Navarra, N. Santoro, Giuseppe Prencipe
Publication date: 10 September 2024
Published in: Distributed Computing (Search for Journal in Brave)
Cites Work
- The optimal tolerance of uniform observation error for mobile robot convergence
- Leader election and gathering for asynchronous fat robots without common chirality
- Gathering of asynchronous robots with limited visibility
- Getting close without touching: near-gathering for autonomous mobile robots
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Gathering few fat mobile robots in the plane
- Plane formation by synchronous mobile robots in the three dimensional Euclidean space
- Distributed computing by mobile robots: uniform circle formation
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Self-stabilizing gathering of mobile robots under crash or Byzantine faults
- Embedded pattern formation by asynchronous robots without chirality
- Forming sequences of geometric patterns with oblivious mobile robots
- Impossibility of gathering by a set of autonomous mobile robots
- Asynchronous arbitrary pattern formation: the effects of a rigorous approach
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Pattern Formation by Mobile Robots with Limited Visibility
- The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
- A New Approach for Analyzing Convergence Algorithms for Mobile Robots
- Distributed Computing by Mobile Robots: Gathering
- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
- The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- A distributed algorithm for gathering many fat mobile robots in the plane
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Brief Announcement
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Arbitrary pattern formation by asynchronous opaque robots with lights
- 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)
