Computing on rings by oblivious robots: a unified approach for different tasks
From MaRDI portal
Publication:494795
DOI10.1007/s00453-014-9892-6zbMath1319.68025WikidataQ62046032 ScholiaQ62046032MaRDI QIDQ494795
Alfredo Navarra, Nicolas Nisse, Gianlorenzo D'Angelo, Karol Suchan, Gabriele Di Stefano
Publication date: 2 September 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01168428/file/ring-asym-journal.pdf
distributed computing; searching; gathering; exploration; asynchronous anonymous networks; look-compute-move; oblivious anonymous robots
Related Items
A unified approach for gathering and exclusive searching on rings under weak assumptions, Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane, Gathering of robots on meeting-points: feasibility and optimal resolution algorithms, Embedded pattern formation by asynchronous robots without chirality, Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings, Universal Systems of Oblivious Mobile Robots
Cites Work
- Energy-efficient strategies for building short chains of mobile robots locally
- The cost of probabilistic agreement in oblivious robot networks
- Gathering of robots on anonymous grids and trees without multiplicity detection
- An annotated bibliography on guaranteed graph searching
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Anonymous graph exploration without collision by mobile robots
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Gathering few fat mobile robots in the plane
- The cost of monotonicity in distributed graph searching
- Impossibility of gathering by a set of autonomous mobile robots
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Gathering six oblivious robots on anonymous symmetric rings
- Gathering asynchronous oblivious mobile robots in a ring
- Exclusive Graph Searching
- Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection
- Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model
- Distributed Computing by Mobile Robots: Gathering
- Tree exploration with logarithmic memory
- Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots
- Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
- Exclusive Perpetual Ring Exploration without Chirality
- Monotonicity in graph searching
- How to Gather Asynchronous Oblivious Robots on Anonymous Rings
- Label-guided graph exploration by a finite automaton
