Gathering six oblivious robots on anonymous symmetric rings

DOI10.1016/J.JDA.2013.09.006MaRDI QIDQ2447532zbMATH OpenOpenAlexFDO

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

Publication date 28 April 2014

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2013.09.006

zbMATH Keywords

anonymous ringsasynchronous systemsgatheringoblivious robots

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Recommendations

• Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
• Gathering Asynchronous Oblivious Mobile Robots in a Ring
• Gathering asynchronous oblivious mobile robots in a ring
• How to gather asynchronous oblivious robots on anonymous rings
• Gathering on rings under the look-compute-move model

Cites work

• 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 oblivious mobile robots in a ring
• Gathering of asynchronous robots with limited visibility
• How to gather asynchronous oblivious robots on anonymous rings
• Impossibility of gathering by a set of autonomous mobile robots
• Optimal gathering of oblivious robots in anonymous graphs
• Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring

Cited in

(20)

• Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
• Gathering robots in graphs: the central role of synchronicity
• Gathering on rings under the look-compute-move model
• Formal verification of mobile robot protocols
• Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
• Asynchronous arbitrary pattern formation: the effects of a rigorous approach
• About ungatherability of oblivious and asynchronous robots on anonymous rings
• Universal systems of oblivious mobile robots
• Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
• How to gather asynchronous oblivious robots on anonymous rings
• Computing on rings by oblivious robots: a unified approach for different tasks
• Gathering over Meeting Nodes in Infinite Grid*
• A unified approach for gathering and exclusive searching on rings under weak assumptions
• Time optimal gathering of myopic robots on an infinite triangular grid
• Optimal Gathering Over Weber Meeting Nodes in Infinite Grid
• On gathering of semi-synchronous robots in graphs
• Time optimal gathering of myopic robots on an infinite triangular grid
• Optimal gathering of robots in anonymous butterfly networks via leader election
• 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: Gathering six oblivious robots on anonymous symmetric rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2447532)