How to Gather Asynchronous Oblivious Robots on Anonymous Rings

DOI10.1007/978-3-642-33651-5_23zbMath1377.68035OpenAlexW1849948963MaRDI QIDQ4909421

Gabriele Di Stefano, Alfredo Navarra, Gianlorenzo D'Angelo

Publication date: 13 March 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33651-5_23

Mathematics Subject Classification ID

Distributed systems (68M14) Artificial intelligence for robotics (68T40)

Related Items (8)

On asynchronous rendezvous in general graphs ⋮ Price of asynchrony in mobile agents computing ⋮ Gathering of robots on anonymous grids and trees without multiplicity detection ⋮ Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model ⋮ Gathering six oblivious robots on anonymous symmetric rings ⋮ Computing on rings by oblivious robots: a unified approach for different tasks ⋮ Gathering on rings under the look-compute-move model ⋮ Optimal Gathering of Oblivious Robots in Anonymous Graphs

This page was built for publication: How to Gather Asynchronous Oblivious Robots on Anonymous Rings