Synchronous robots vs asynchronous lights-enhanced robots on graphs

DOI10.1016/J.ENTCS.2016.03.012MaRDI QIDQ737100zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

synchronicitydistributed algorithmmobile robotsluminous robots

Mathematics Subject Classification ID

Agent technology and artificial intelligence (68T42) Distributed algorithms (68W15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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

Cites work

• Asynchronous pattern formation by anonymous oblivious mobile robots
• Computing without communicating: ring exploration by asynchronous oblivious robots
• Exploring an unknown dangerous graph using tokens
• Gathering an even number of robots in an odd ring without global multiplicity detection
• Gathering despite mischief
• Gathering of asynchronous robots with limited visibility
• Gathering of oblivious robots on infinite grids with minimum traveled distance
• Gathering on rings under the look-compute-move model
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• Minmax-distance gathering on given meeting points
• On the computational power of oblivious robots
• Optimal gathering of oblivious robots in anonymous graphs
• Optimal probabilistic ring exploration by semi-synchronous oblivious robots
• Remembering without memory: tree exploration by asynchronous oblivious robots

Cited in

(9)

• 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
• Gathering robots in graphs: the central role of synchronicity
• Autonomous mobile robots with lights
• Gathering problems for autonomous mobile robots with lights
• Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies
• Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
• Rendezvous of Asynchronous Mobile Robots with Lights
• Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-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)