How to gather asynchronous oblivious robots on anonymous rings

DOI10.1007/978-3-642-33651-5_23MaRDI QIDQ4909421zbMATH OpenOpenAlexFDO

Authors Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra

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

Mathematics Subject Classification ID

Distributed systems (68M14) Artificial intelligence for robotics (68T40)

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

(19)

• On asynchronous rendezvous in general graphs
• Parameterized verification of algorithms for oblivious robots on a ring
• 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 and its application on trees and rings
• Gathering six oblivious robots on anonymous symmetric rings
• Gathering asynchronous oblivious mobile robots in a ring
• On the self-stabilization of mobile oblivious robots in uniform rings
• Price of asynchrony in mobile agents computing
• About ungatherability of oblivious and asynchronous robots on anonymous rings
• Optimal gathering of oblivious robots in anonymous graphs
• 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
• Gathering asynchronous robots in the presence of obstacles
• Mobile robots gathering algorithm with local weak multiplicity in rings
• Computing on rings by oblivious robots: a unified approach for different tasks
• Gathering Asynchronous Oblivious Mobile Robots in a Ring
• Gathering of robots on anonymous grids and trees without multiplicity detection
• Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring

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)