Optimal Gathering of Oblivious Robots in Anonymous Graphs

DOI10.1007/978-3-319-03578-9_18zbMath1406.68109OpenAlexW114411412MaRDI QIDQ2868646

Gabriele Di Stefano, Alfredo Navarra

Publication date: 17 December 2013

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03578-9_18

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Related Items (7)

Gathering Anonymous, Oblivious Robots on a Grid ⋮ Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Gathering six oblivious robots on anonymous symmetric rings ⋮ Gathering of oblivious robots on infinite grids with minimum traveled distance ⋮ Gathering on rings under the look-compute-move model ⋮ Synchronous robots vs asynchronous lights-enhanced robots on graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Foundations of location analysis
• Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
• Impossibility of gathering by a set of autonomous mobile robots
• Gathering asynchronous oblivious mobile robots in a ring
• Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model
• Distributed Computing by Mobile Robots: Gathering
• Design and Analysis of Distributed Algorithms
• Mobile Agent Rendezvous in a Synchronous Torus
• How to Gather Asynchronous Oblivious Robots on Anonymous Rings

This page was built for publication: Optimal Gathering of Oblivious Robots in Anonymous Graphs