Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation
type: Item
instance of: scholarly article
title: Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation
zbMATH Open document ID: 1499.68351
author: Jannik Castenow
author: Jonas Harbig
author: Daniel Jung
author: Till Knollmann
author: Friedhelm Meyer auf der Heide
published in: Theoretical Computer Science
publication date: 2022-11-17T00:00:00Z
Mathematics Subject Classification ID: 68T40
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 7619409
zbMATH Keywords: gathering
zbMATH Keywords: limited visibility
zbMATH Keywords: disoriented
zbMATH Keywords: runtime
MaRDI profile type: Publication
full work available at URL: j.tcs.2022.10.031
OpenAlex ID: W4307723340
cites work: Optimal strategies for maintaining a chain of relays between an explorer and a base camp
cites work: Gathering a Euclidean closed chain of robots in linear time
cites work: Local spreading algorithms for autonomous robot systems
cites work: Lost in self-stabilization: a local process that aligns connected cells
cites work: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
cites work: Gathering anonymous, oblivious robots on a grid
cites work: Universally Optimal Gathering Under Limited Visibility
cites work: Energy-efficient strategies for building short chains of mobile robots locally
cites work: The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots
cites work: Complexity of network synchronization
cites work: Autonomous mobile robots with lights
cites work: A Discrete and Continuous Study of the Max-Chain-Formation Problem
cites work: The Max-Line-Formation Problem
DOI: 10.1016/J.TCS.2022.10.031
description: scientific article; zbMATH DE number 7619409