Gathering on rings under the look-compute-move model

DOI10.1007/s00446-014-0212-9zbMath1320.68046MaRDI QIDQ2256947

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra

Publication date: 23 February 2015

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-014-0212-9

zbMATH Keywords

distributed algorithm; gathering; asynchronous system; oblivious robots

Mathematics Subject Classification ID

68M14: Distributed systems

68T40: Artificial intelligence for robotics

68W15: Distributed algorithms

Related Items

Gathering over Meeting Nodes in Infinite Grid*, Memory optimal dispersion by anonymous mobile robots, A structured methodology for designing distributed algorithms for mobile entities, Optimal Gathering Over Weber Meeting Nodes in Infinite Grid, Anonymous meeting in networks, A unified approach for gathering and exclusive searching on rings under weak assumptions, Gathering of oblivious robots on infinite grids with minimum traveled distance, Synchronous robots vs asynchronous lights-enhanced robots on graphs, Memory optimal dispersion by anonymous mobile robots, Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane, Gathering of robots on meeting-points: feasibility and optimal resolution algorithms, The topology of look-compute-move robot wait-free algorithms with hard termination, Ring exploration with myopic luminous robots, Gathering robots in graphs: the central role of synchronicity, Fault-induced dynamics of oblivious robots on a line, Embedded pattern formation by asynchronous robots without chirality, Asynchronous approach in the plane: a deterministic polynomial algorithm, Deterministic rendezvous with different maps, 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, On the self-stabilization of mobile oblivious robots in uniform rings, Universal Systems of Oblivious Mobile Robots, MinMax-Distance Gathering on Given Meeting Points, Model Checking of Robot Gathering

Cites Work

• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• Gathering of robots on anonymous grids and trees without multiplicity detection
• Remembering without memory: tree exploration by asynchronous oblivious robots
• Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
• Computing without communicating: ring exploration by asynchronous oblivious robots
• Gathering six oblivious robots on anonymous symmetric rings
• Gathering asynchronous oblivious mobile robots in a ring
• Deterministic rendezvous in graphs
• Exclusive Graph Searching
• 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
• A New Approach for Analyzing Convergence Algorithms for Mobile Robots
• Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings
• Rendezvous of Mobile Agents without Agreement on Local Orientation
• Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
• Exclusive Perpetual Ring Exploration without Chirality
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• The Rendezvous Search Problem
• How to Gather Asynchronous Oblivious Robots on Anonymous Rings