Synchronous robots vs asynchronous lights-enhanced robots on graphs
From MaRDI portal
Publication:737100
DOI10.1016/J.ENTCS.2016.03.012zbMath1345.68257OpenAlexW2341715933WikidataQ113317692 ScholiaQ113317692MaRDI QIDQ737100
Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra
Publication date: 5 August 2016
Full work available at URL: https://doi.org/10.1016/j.entcs.2016.03.012
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15) Agent technology and artificial intelligence (68T42)
Related Items (4)
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane ⋮ Gathering problems for autonomous mobile robots with lights ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination
Cites Work
- Gathering of oblivious robots on infinite grids with minimum traveled distance
- Gathering of asynchronous robots with limited visibility
- Remembering without memory: tree exploration by asynchronous oblivious robots
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Exploring an unknown dangerous graph using tokens
- Gathering on rings under the look-compute-move model
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Optimal Gathering of Oblivious Robots in Anonymous Graphs
- Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection
- MinMax-Distance Gathering on Given Meeting Points
- Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots
- Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots
- Gathering Despite Mischief
- On the computational power of oblivious robots
This page was built for publication: Synchronous robots vs asynchronous lights-enhanced robots on graphs
