Synchronous robots vs asynchronous lights-enhanced robots on graphs
DOI10.1016/J.ENTCS.2016.03.012zbMATH Open1345.68257OpenAlexW2341715933WikidataQ113317692 ScholiaQ113317692MaRDI QIDQ737100FDOQ737100
Authors: 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
Recommendations
- Autonomous mobile robots with lights
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- The topology of look-compute-move robot wait-free algorithms with hard termination
- Rendezvous of Asynchronous Mobile Robots with Lights
- Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
Agent technology and artificial intelligence (68T42) Distributed algorithms (68W15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Gathering on rings under the look-compute-move model
- Gathering despite mischief
- On the computational power of oblivious robots
- Gathering of asynchronous robots with limited visibility
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Exploring an unknown dangerous graph using tokens
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Gathering an even number of robots in an odd ring without global multiplicity detection
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Gathering of oblivious robots on infinite grids with minimum traveled distance
- Optimal gathering of oblivious robots in anonymous graphs
- Asynchronous pattern formation by anonymous oblivious mobile robots
- Minmax-distance gathering on given meeting points
Cited In (9)
- Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies
- Gathering robots in graphs: the central role of synchronicity
- Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
- The topology of look-compute-move robot wait-free algorithms with hard termination
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Autonomous mobile robots with lights
- Gathering problems for autonomous mobile robots with lights
- Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights
- Rendezvous of Asynchronous Mobile Robots with Lights
This page was built for publication: Synchronous robots vs asynchronous lights-enhanced robots on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q737100)
