On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
From MaRDI portal
(Redirected from Publication:6601211)
Cites work
- A distributed algorithm for gathering many fat mobile robots in the plane
- A new approach for analyzing convergence algorithms for mobile robots
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- 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
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Distributed computing by mobile robots: gathering
- Distributed computing by mobile robots: uniform circle formation
- Embedded pattern formation by asynchronous robots without chirality
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Forming sequences of geometric patterns with oblivious mobile robots
- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
- Gathering few fat mobile robots in the plane
- Gathering of asynchronous robots with limited visibility
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Getting close without touching: near-gathering for autonomous mobile robots
- Impossibility of gathering by a set of autonomous mobile robots
- Leader election and gathering for asynchronous fat robots without common chirality
- Pattern formation by mobile robots with limited visibility
- Self-stabilizing gathering of mobile robots under crash or Byzantine faults
- Separating Bounded and Unbounded Asynchrony for Autonomous Robots
- The gathering problem for two oblivious robots with unreliable compasses
- The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
- The optimal tolerance of uniform observation error for mobile robot convergence
Cited in
(2)
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)
