Gathering of robots on anonymous grids and trees without multiplicity detection
From MaRDI portal
Publication:896693
DOI10.1016/j.tcs.2014.06.045zbMath1332.68167OpenAlexW2005449022MaRDI QIDQ896693
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Ralf Klasing
Publication date: 10 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.06.045
distributed computingtree networksgatheringanonymous networkslook-compute-movegrid networksoblivious asynchronous robots
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items
On asynchronous rendezvous in general graphs ⋮ Gathering over Meeting Nodes in Infinite Grid* ⋮ Ring exploration with myopic luminous robots ⋮ Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings ⋮ Mutual visibility on grid by asynchronous luminous robots ⋮ Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots ⋮ 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 of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ 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 of oblivious robots on infinite grids with minimum traveled distance ⋮ Gathering on rings under the look-compute-move model ⋮ Gathering anonymous, oblivious robots on a grid ⋮ Embedded pattern formation by asynchronous robots without chirality ⋮ Universal Systems of Oblivious Mobile Robots ⋮ Deterministic rendezvous with different maps ⋮ Arbitrary pattern formation on infinite regular tessellation graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- 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
- 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
- Deterministic rendezvous in graphs
- Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection
- A New Approach for Analyzing Convergence Algorithms for Mobile Robots
- Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots
- Design and Analysis of Distributed Algorithms
- 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
