Gathering asynchronous robots in the presence of obstacles
From MaRDI portal
Publication:2980916
Recommendations
Cites work
- scientific article; zbMATH DE number 1629980 (Why is no real title available?)
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- A distributed algorithm for gathering many fat mobile robots in the plane
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Distributed algorithms for partitioning a swarm of autonomous mobile robots
- Distributed computing by mobile robots: gathering
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Gathering few fat mobile robots in the plane
- Gathering of asynchronous robots with limited visibility
- Impossibility of gathering by a set of autonomous mobile robots
- Leader election and gathering for asynchronous fat robots without common chirality
Cited in
(7)- Synchronous gathering without multiplicity detection: a certified algorithm
- Optimum Gathering of Asynchronous Robots
- Gathering fat mobile robots with slim omnidirectional cameras
- Synchronous gathering without multiplicity detection: a certified algorithm
- Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses
- Gathering asynchronous oblivious mobile robots in a ring
- scientific article; zbMATH DE number 1688369 (Why is no real title available?)
This page was built for publication: Gathering asynchronous robots in the presence of obstacles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980916)