Gathering of oblivious robots on infinite grids with minimum traveled distance
DOI10.1016/J.IC.2016.09.004zbMATH Open1370.68286OpenAlexW2522627346MaRDI QIDQ528200FDOQ528200
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
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
distributed computingasynchronous systemlook-compute-move modeloblivious and anonymous robotsWeber point
Artificial intelligence for robotics (68T40) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- Gathering on rings under the look-compute-move model
- Gathering asynchronous oblivious mobile robots in a ring
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- How to meet asynchronously at polynomial cost
- Gathering of asynchronous robots with limited visibility
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- The algebraic degree of geometric optimization problems
- Title not available (Why is that?)
- Network Exploration by Silent and Oblivious Robots
- Euclidean Constructibility in Graph-Minimization Problems
- Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model
- Gathering of robots on anonymous grids and trees without multiplicity detection
- Optimal Gathering of Oblivious Robots in Anonymous Graphs
Cited In (20)
- Gathering robots in graphs: the central role of synchronicity
- Arbitrary pattern formation on infinite regular tessellation graphs
- Optimal deterministic protocols for mobile robots on a grid
- Time optimal gathering of myopic robots on an infinite triangular grid
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Optimal Gathering Over Weber 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
- Gathering Anonymous, Oblivious Robots on a Grid
- Gathering over Meeting Nodes in Infinite Grid*
- Mutual visibility on grid by asynchronous luminous robots
- Grid exploration by a swarm of autonomous robots with minimum repetitions
- The general position number of integer lattices
- Embedded pattern formation by asynchronous robots without chirality
- Parking problem by oblivious mobile robots in infinite grids
- Arbitrary pattern formation on infinite grid by asynchronous oblivious robots
- Deterministic rendezvous with different maps
- On gathering of semi-synchronous robots in graphs
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- 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)
