Gathering of oblivious robots on infinite grids with minimum traveled distance

DOI10.1016/j.ic.2016.09.004zbMath1370.68286MaRDI QIDQ528200

Gabriele Di Stefano, Alfredo Navarra

Publication date: 12 May 2017

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2016.09.004

zbMATH Keywords

distributed computing; asynchronous system; look-compute-move model; oblivious and anonymous robots; Weber point

Mathematics Subject Classification ID

68M14: Distributed systems

68T40: Artificial intelligence for robotics

68W15: Distributed algorithms

Related Items

A unified approach for gathering and exclusive searching on rings under weak assumptions, Synchronous robots vs asynchronous lights-enhanced robots on graphs, Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane, Embedded pattern formation by asynchronous robots without chirality, Deterministic rendezvous with different maps, Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings

Cites Work

• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• Gathering of robots on anonymous grids and trees without multiplicity detection
• Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
• The algebraic degree of geometric optimization problems
• Gathering on rings under the look-compute-move model
• Gathering asynchronous oblivious mobile robots in a ring
• Optimal Gathering of Oblivious Robots in Anonymous Graphs
• Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model
• Network Exploration by Silent and Oblivious Robots
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• How to meet asynchronously at polynomial cost
• Euclidean Constructibility in Graph-Minimization Problems