Minmax-distance gathering on given meeting points
From MaRDI portal
Publication:2947015
Recommendations
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Optimum Gathering of Asynchronous Robots
- Gathering of oblivious robots on infinite grids with minimum traveled distance
- Optimal gathering of oblivious robots in anonymous graphs
- Gathering over meeting nodes in infinite grid
Cites work
- Distributed computing by mobile robots: gathering
- Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
- Gathering asynchronous oblivious mobile robots in a ring
- Gathering few fat mobile robots in the plane
- Gathering on rings under the look-compute-move model
- Impossibility of gathering by a set of autonomous mobile robots
- Mobile Agent Rendezvous in a Synchronous Torus
- Rendezvous of mobile agents in directed graphs
- n-Ellipses and the Minimum Distance Sum Problem
Cited in
(8)- Gathering robots in graphs: the central role of synchronicity
- Optimum Gathering of Asynchronous Robots
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Synchronous robots vs asynchronous lights-enhanced robots on graphs
- Gathering over meeting nodes in infinite grid
- On gathering of semi-synchronous robots in graphs
- Gathering of oblivious robots on infinite grids with minimum traveled distance
- Computing an approximation of the 1-center problem on weighted terrain surfaces
This page was built for publication: Minmax-distance gathering on given meeting points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947015)
