MinMax-Distance Gathering on Given Meeting Points
From MaRDI portal
Publication:2947015
DOI10.1007/978-3-319-18173-8_9zbMath1459.68211OpenAlexW953588704MaRDI QIDQ2947015
Gabriele Di Stefano, Alfredo Navarra, Serafino Cicerone
Publication date: 21 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18173-8_9
Related Items
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms, Optimum Gathering of Asynchronous Robots, Gathering robots in graphs: the central role of synchronicity, Synchronous robots vs asynchronous lights-enhanced robots on graphs
Cites Work
- 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
- Gathering asynchronous oblivious mobile robots in a ring
- n-Ellipses and the Minimum Distance Sum Problem
- Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model
- Distributed Computing by Mobile Robots: Gathering
- Mobile Agent Rendezvous in a Synchronous Torus
- Rendezvous of Mobile Agents in Directed Graphs