A unified approach for gathering and exclusive searching on rings under weak assumptions
type: Item
instance of: scholarly article
title: A unified approach for gathering and exclusive searching on rings under weak assumptions
zbMATH Open document ID: 1404.68018
author: Gianlorenzo D'Angelo
author: Alfredo Navarra
author: Nicolas Nisse
published in: Distributed Computing
publication date: 2017-03-29T00:00:00Z
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 6697937
MaRDI profile type: Publication
full work available at URL: s00446-016-0274-y
OpenAlex ID: W2400422553
cites work: Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
cites work: Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
cites work: Exclusive Graph Searching
cites work: Exclusive Perpetual Ring Exploration without Chirality
cites work: Computing without communicating: ring exploration by asynchronous oblivious robots
cites work: Rendezvous of Mobile Agents without Agreement on Local Orientation
cites work: Network Exploration by Silent and Oblivious Robots
cites work: Distributed Computing by Mobile Robots: Gathering
cites work: Gathering few fat mobile robots in the plane
cites work: Gathering of robots on anonymous grids and trees without multiplicity detection
cites work: Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model
cites work: Gathering on rings under the look-compute-move model
cites work: Gathering six oblivious robots on anonymous symmetric rings
cites work: Computing on rings by oblivious robots: a unified approach for different tasks
cites work: Gathering of oblivious robots on infinite grids with minimum traveled distance
cites work: About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings
cites work: Q5743418
cites work: Remembering without memory: tree exploration by asynchronous oblivious robots
cites work: How many oblivious robots can explore a line
cites work: Q2729100
cites work: An annotated bibliography on guaranteed graph searching
cites work: The cost of monotonicity in distributed graph searching
cites work: Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings
cites work: The gathering problem for two oblivious robots with unreliable compasses
cites work: Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection
cites work: Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
cites work: Gathering asynchronous oblivious mobile robots in a ring
cites work: Mobile Agent Rendezvous in a Synchronous Torus
cites work: Q4448363
DOI: 10.1007/S00446-016-0274-Y
Recommended article: Gathering on rings under the look-compute-move model
Recommended article: On range searching with semialgebraic sets
Recommended article: Distributed Computing - IWDC 2004
Recommended article: Beyond Rings: Gathering in 1-Interval Connected Graphs
Recommended article: Q5691918
Recommended article: A simple, efficient algorithm for maximum finding on rings
Recommended article: Q4473267
Recommended article: On Range Searching in the Group Model and Combinatorial Discrepancy
description: scientific article; zbMATH DE number 6697937