About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings
From MaRDI portal
Publication:2798226
DOI10.1007/978-3-319-29516-9_12zbMath1474.68381OpenAlexW2336642745MaRDI QIDQ2798226
Gabriele Di Stefano, Pietro Montanari, Alfredo Navarra
Publication date: 4 April 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-29516-9_12
Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)
Related Items (5)
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 ⋮ Asynchronous arbitrary pattern formation: the effects of a rigorous approach ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ A unified approach for gathering and exclusive searching on rings under weak assumptions
This page was built for publication: About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings
