Embedded pattern formation by asynchronous robots without chirality
From MaRDI portal
Publication:2318112
DOI10.1007/s00446-018-0333-7zbMath1432.68025OpenAlexW2799471132MaRDI QIDQ2318112
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
Publication date: 13 August 2019
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-018-0333-7
pattern formationasynchronousautonomous mobile robotsdistributed coordinationobliviouslogical predicate
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Related Items
Gathering over Meeting Nodes in Infinite Grid* ⋮ \(k\)-circle formation by disoriented asynchronous robots ⋮ A structured methodology for designing distributed algorithms for mobile entities ⋮ Molecular pattern formation on grids in the \textsc{Moblot} model ⋮ Optimal Gathering Over Weber Meeting Nodes in Infinite Grid ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ Arbitrary pattern formation on infinite regular tessellation graphs
Cites Work
- Impossibility of gathering, a certification
- 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 asynchronous robots with limited visibility
- The effect of synchronicity on the behavior of autonomous mobile robots
- Gathering of robots on anonymous grids and trees without multiplicity detection
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Asynchronous embedded pattern formation without orientation
- Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots
- Plane formation by synchronous mobile robots in the three dimensional Euclidean space
- Distributed computing by mobile robots: uniform circle formation
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Gathering on rings under the look-compute-move model
- Forming sequences of geometric patterns with oblivious mobile robots
- Formal verification of mobile robot protocols
- 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
- Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement
- Distributed Computing by Mobile Robots: Gathering
- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots
- Model Checking of a Mobile Robots Perpetual Exploration Algorithm
- Pattern Formation by Oblivious Asynchronous Mobile Robots
- Brief Announcement
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
