A Continuous Strategy for Collisionless Gathering
From MaRDI portal
Recommendations
- A continuous strategy for collisionless gathering
- Collisionless gathering of robots with an extent
- 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
- scientific article; zbMATH DE number 2038783
Cites work
- A Continuous Strategy for Collisionless Gathering
- A distributed algorithm for gathering many fat mobile robots in the plane
- Algorithms – ESA 2004
- Distributed computing by mobile robots: gathering
- 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
(6)- A continuous strategy for collisionless gathering
- A Continuous Strategy for Collisionless Gathering
- Local Gathering of Mobile Robots in Three Dimensions
- 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
- Symmetry breaking in the plane. Rendezvous by robots with unknown attributes
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 Q5056062)