On gathering of semi-synchronous robots in graphs
From MaRDI portal
Publication:6536329
DOI10.1007/978-3-030-34992-9_7zbMATH Open1539.68044MaRDI QIDQ6536329
Alfredo Navarra, Serafino Cicerone, Gabriele Di Stefano
Publication date: 19 April 2024
Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Cites Work
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
- 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 of oblivious robots on infinite grids with minimum traveled distance
- Gathering of robots on anonymous grids and trees without multiplicity detection
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Gathering on rings under the look-compute-move model
- Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies
- 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 six oblivious robots on anonymous symmetric rings
- MinMax-Distance Gathering on Given Meeting Points
- Distributed Computing by Mobile Robots: Gathering
- Optimal gathering by asynchronous oblivious robots in hypercubes
This page was built for publication: On gathering of semi-synchronous robots in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536329)
