Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model

DOI10.1007/978-1-4614-6825-7_13zbMath1356.68016OpenAlexW1495128630MaRDI QIDQ2961405

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra

Publication date: 20 February 2017

Published in: Search Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-6825-7_13

Mathematics Subject Classification ID

Applications of game theory (91A80) Distributed systems (68M14) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (13)

Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings ⋮ MinMax-Distance Gathering on Given Meeting Points ⋮ Molecular robots with chirality on grids ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ Gathering six oblivious robots on anonymous symmetric rings ⋮ 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 of oblivious robots on infinite grids with minimum traveled distance ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ Gathering on rings under the look-compute-move model ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots ⋮ Optimal Gathering of Oblivious Robots in Anonymous Graphs

Cites Work

• Unnamed Item
• 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
• Gathering few fat mobile robots in the plane
• The theory of search games and rendezvous.
• Impossibility of gathering by a set of autonomous mobile robots
• 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
• Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection
• Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots
• Design and Analysis of Distributed Algorithms
• Mobile Agent Rendezvous in a Synchronous Torus
• Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings
• Exclusive Perpetual Ring Exploration without Chirality
• Rendezvous Search: A Personal Perspective
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• How to Gather Asynchronous Oblivious Robots on Anonymous Rings

This page was built for publication: Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model