A continuous strategy for collisionless gathering
From MaRDI portal
Recommendations
- A Continuous Strategy for Collisionless Gathering
- Collisionless gathering of robots with an extent
- scientific article; zbMATH DE number 2038783
- The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots
- Getting close without touching: near-gathering for autonomous mobile robots
Cites work
- A distributed algorithm for gathering many fat mobile robots in the plane
- Algorithms – ESA 2004
- Gathering anonymous, oblivious robots on a grid
- scientific article; zbMATH DE number 1017537 (Why is no real title available?)
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots
- The relative neighbourhood graph of a finite planar set
Cited in
(11)- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- Gathering by repulsion
- A discrete and continuous study of the \textsc{Max-Chain-Formation} problem
- Collisionless gathering of robots with an extent
- A Continuous Strategy for Collisionless Gathering
- Local Gathering of Mobile Robots in Three Dimensions
- Gathering by repulsion
- The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots
- The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots
- Unifying gathering protocols for swarms of mobile robots
- Getting close without touching: near-gathering for autonomous mobile robots
This page was built for publication: A continuous strategy for collisionless gathering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220827)