Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection

DOI10.1007/978-3-642-32589-2_48zbMath1365.68421arXiv1207.7241OpenAlexW1603701075MaRDI QIDQ2912753

Anissa Lamani, Sébastien Tixeuil, Fukuhito Ooshita, Sayaka Kamei

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.7241

zbMATH Keywords

robotsasynchronous gatheringlocal weak multiplicity detection

Mathematics Subject Classification ID

Network protocols (68M12) Artificial intelligence for robotics (68T40)

Related Items (17)

Formal verification of mobile robot protocols ⋮ On asynchronous rendezvous in general graphs ⋮ Gathering over Meeting Nodes in Infinite Grid* ⋮ Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane ⋮ Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings ⋮ Gathering of robots on anonymous grids and trees without multiplicity detection ⋮ Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model ⋮ Optimal Gathering Over Weber Meeting Nodes in Infinite Grid ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Gathering six oblivious robots on anonymous symmetric rings ⋮ 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 on rings under the look-compute-move model ⋮ On the self-stabilization of mobile oblivious robots in uniform rings ⋮ Synchronous robots vs asynchronous lights-enhanced robots on graphs ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots ⋮ Universal Systems of Oblivious Mobile Robots

This page was built for publication: Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection