Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
type: Item
instance of: scholarly article
title: Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
zbMATH Open document ID: 1195.68099
author: Ralf Klasing
author: Adrian Kosowski
author: Alfredo Navarra
published in: Theoretical Computer Science
publication date: 2010-08-11T00:00:00Z
Mathematics Subject Classification ID: 68T40
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 5768917
zbMATH Keywords: asynchronous system
zbMATH Keywords: mobile robots
zbMATH Keywords: oblivious robots
zbMATH Keywords: gathering problem
zbMATH Keywords: ring
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.05.020
OpenAlex ID: W2001165134
cites work: Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
cites work: LATIN 2004: Theoretical Informatics
cites work: Q4449250
cites work: Structural Information and Communication Complexity
cites work: Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
cites work: Asynchronous deterministic rendezvous in graphs
cites work: Deterministic rendezvous in graphs
cites work: Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
cites work: Gathering of asynchronous robots with limited visibility
cites work: SOFSEM 2006: Theory and Practice of Computer Science
cites work: Gathering asynchronous oblivious mobile robots in a ring
cites work: Algorithms and Computation
cites work: Impossibility of gathering by a set of autonomous mobile robots
cites work: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
DOI: 10.1016/J.TCS.2010.05.020
description: scientific article; zbMATH DE number 5768917