Gathering of oblivious robots on infinite grids with minimum traveled distance

DOI10.1016/J.IC.2016.09.004MaRDI QIDQ528200zbMATH OpenOpenAlexFDO

Authors 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 computingasynchronous systemlook-compute-move modeloblivious and anonymous robotsWeber point

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Optimal gathering of oblivious robots in anonymous graphs
• 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
• Minmax-distance gathering on given meeting points
• Gathering over meeting nodes in infinite grid

Cites work

• scientific article; zbMATH DE number 1054765 (Why is no real title available?)
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Euclidean Constructibility in Graph-Minimization Problems
• Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
• Gathering asynchronous oblivious mobile robots in a ring
• Gathering of asynchronous robots with limited visibility
• Gathering of robots on anonymous grids and trees without multiplicity detection
• Gathering on rings under the look-compute-move model
• Network exploration by silent and oblivious robots
• Optimal gathering of oblivious robots in anonymous graphs
• Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
• The algebraic degree of geometric optimization problems

Cited in

(24)

• The general position number of integer lattices
• Parking problem by oblivious mobile robots in infinite grids
• Gathering over meeting nodes in infinite grid
• Deterministic rendezvous with different maps
• Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
• Gathering robots in graphs: the central role of synchronicity
• Gathering over Meeting Nodes in Infinite Grid*
• Synchronous robots vs asynchronous lights-enhanced robots on graphs
• Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
• Arbitrary pattern formation on infinite regular tessellation graphs
• Embedded pattern formation by asynchronous robots without chirality
• On gathering of semi-synchronous robots in graphs
• Minmax-distance gathering on given meeting points
• Optimal deterministic protocols for mobile robots on a grid
• Time optimal gathering of myopic robots on an infinite triangular grid
• Gathering anonymous, oblivious robots on a grid
• Gathering Anonymous, Oblivious Robots on a Grid
• A unified approach for gathering and exclusive searching on rings under weak assumptions
• Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
• Optimal Gathering Over Weber Meeting Nodes in Infinite Grid
• Mutual visibility on grid by asynchronous luminous robots
• Time optimal gathering of myopic robots on an infinite triangular grid
• Grid exploration by a swarm of autonomous robots with minimum repetitions
• Optimal deterministic protocols for mobile robots on a grid

This page was built for publication: Gathering of oblivious robots on infinite grids with minimum traveled distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528200)