How to gather asynchronous oblivious robots on anonymous rings
From MaRDI portal
Publication:4909421
DOI10.1007/978-3-642-33651-5_23zbMATH Open1377.68035OpenAlexW1849948963MaRDI QIDQ4909421FDOQ4909421
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
Recommendations
- Gathering on rings under the look-compute-move model
- Gathering asynchronous oblivious mobile robots in a ring
- Gathering Asynchronous Oblivious Mobile Robots in a Ring
- About ungatherability of oblivious and asynchronous robots on anonymous rings
- Gathering six oblivious robots on anonymous symmetric rings
Cited In (13)
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Gathering six oblivious robots on anonymous symmetric rings
- On asynchronous rendezvous in general graphs
- Mobile robots gathering algorithm with local weak multiplicity in rings
- Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model
- Price of asynchrony in mobile agents computing
- Gathering on rings under the look-compute-move model
- Optimal Gathering of Oblivious Robots in Anonymous Graphs
- Gathering asynchronous oblivious mobile robots in a ring
- Gathering Asynchronous Oblivious Mobile Robots in a Ring
- Parameterized verification of algorithms for oblivious robots on a ring
- Computing on rings by oblivious robots: a unified approach for different tasks
- Gathering of robots on anonymous grids and trees without multiplicity detection
This page was built for publication: How to gather asynchronous oblivious robots on anonymous rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909421)
