Computing on rings by oblivious robots: a unified approach for different tasks
type: Item
instance of: scholarly article
title: Computing on rings by oblivious robots: a unified approach for different tasks
zbMATH Open document ID: 1319.68025
author: Gianlorenzo D'Angelo
author: Gabriele Di Stefano
author: Alfredo Navarra
author: Nicolas Nisse
author: Karol Suchan
published in: Algorithmica
publication date: 2015-09-02T00:00:00Z
full work available at URL: ring-asym-journal.pdf
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68T40
zbMATH DE Number: 6477667
zbMATH Keywords: distributed computing
zbMATH Keywords: exploration
zbMATH Keywords: searching
zbMATH Keywords: gathering
zbMATH Keywords: oblivious anonymous robots
zbMATH Keywords: asynchronous anonymous networks
zbMATH Keywords: look-compute-move
MaRDI profile type: Publication
OpenAlex ID: W2093596574
Wikidata QID: Q62046032
cites work: Tree exploration with logarithmic memory
cites work: Anonymous graph exploration without collision by mobile robots
cites work: Impossibility of gathering by a set of autonomous mobile robots
cites work: Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
cites work: Monotonicity in graph searching
cites work: Exclusive Perpetual Ring Exploration without Chirality
cites work: Exclusive Graph Searching
cites work: Energy-efficient strategies for building short chains of mobile robots locally
cites work: The cost of probabilistic agreement in oblivious robot networks
cites work: Label-guided graph exploration by a finite automaton
cites work: Gathering few fat mobile robots in the plane
cites work: Gathering six oblivious robots on anonymous symmetric rings
cites work: Gathering of robots on anonymous grids and trees without multiplicity detection
cites work: How to Gather Asynchronous Oblivious Robots on Anonymous Rings
cites work: Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model
cites work: Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots
cites work: Remembering without memory: tree exploration by asynchronous oblivious robots
cites work: Distributed Computing by Mobile Robots: Gathering
cites work: Computing without communicating: ring exploration by asynchronous oblivious robots
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: Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection
cites work: Gathering asynchronous oblivious mobile robots in a ring
cites work: Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
DBLP publication ID: journals/algorithmica/DAngeloSNNS15
DOI: 10.1007/S00453-014-9892-6
description: scientific article; zbMATH DE number 6477667