Gathering six oblivious robots on anonymous symmetric rings
From MaRDI portal
Publication:2447532
DOI10.1016/j.jda.2013.09.006zbMath1298.68270OpenAlexW2013640428MaRDI QIDQ2447532
Alfredo Navarra, Gianlorenzo D'Angelo, Gabriele Di Stefano
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
Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)
Related Items (14)
Formal verification of mobile robot protocols ⋮ Gathering over Meeting Nodes in Infinite Grid* ⋮ Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane ⋮ 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 ⋮ Gathering of robots on anonymous grids and trees without multiplicity detection ⋮ Time optimal gathering of myopic robots on an infinite triangular grid ⋮ Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model ⋮ Optimal Gathering Over Weber Meeting Nodes in Infinite Grid ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ Computing on rings by oblivious robots: a unified approach for different tasks ⋮ A unified approach for gathering and exclusive searching on rings under weak assumptions ⋮ Gathering on rings under the look-compute-move model ⋮ Universal Systems of Oblivious Mobile Robots
Cites Work
- Gathering of asynchronous robots with limited visibility
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Impossibility of gathering by a set of autonomous mobile robots
- Gathering asynchronous oblivious mobile robots in a ring
- 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
- How to Gather Asynchronous Oblivious Robots on Anonymous Rings
This page was built for publication: Gathering six oblivious robots on anonymous symmetric rings
