A unified approach for gathering and exclusive searching on rings under weak assumptions
From MaRDI portal
Publication:518678
DOI10.1007/s00446-016-0274-yzbMath1404.68018OpenAlexW2400422553MaRDI QIDQ518678
Gianlorenzo D'Angelo, Nicolas Nisse, Alfredo Navarra
Publication date: 29 March 2017
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-016-0274-y
Related Items (12)
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane ⋮ Ring exploration with myopic luminous robots ⋮ Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings ⋮ Model Checking of Robot Gathering ⋮ Ring exploration of myopic luminous robots with visibility more than one ⋮ Almost universal anonymous rendezvous in the plane ⋮ Gathering of robots on anonymous grids and trees without multiplicity detection ⋮ Cops and robber on oriented graphs with respect to push operation ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ A unified approach for gathering and exclusive searching on rings under weak assumptions ⋮ On-line search in two-dimensional environment ⋮ Embedded pattern formation by asynchronous robots without chirality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 of robots on anonymous grids and trees without multiplicity detection
- An annotated bibliography on guaranteed graph searching
- 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
- How many oblivious robots can explore a line
- Gathering on rings under the look-compute-move model
- The cost of monotonicity in distributed graph searching
- 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
- About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings
- Exclusive Graph Searching
- The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
- 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
- Network Exploration by Silent and Oblivious Robots
- Distributed Computing by Mobile Robots: Gathering
- Mobile Agent Rendezvous in a Synchronous Torus
- 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
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
This page was built for publication: A unified approach for gathering and exclusive searching on rings under weak assumptions
