scientific article; zbMATH DE number 7561271
From MaRDI portal
Publication:5090910
DOI10.4230/LIPIcs.DISC.2018.19zbMath1497.68211MaRDI QIDQ5090910
Paola Flocchini, Giuseppe Antonio Di Luna, Giovanni Viglietta, Nicola Santoro
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Agent technology and artificial intelligence (68T42)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Impossibility of gathering, a certification
- Gathering of asynchronous robots with limited visibility
- Getting close without touching: near-gathering for autonomous mobile robots
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- 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
- Flocking with oblivious robots
- Forming sequences of geometric patterns with oblivious mobile robots
- Distributed Computing by Mobile Robots: Gathering
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- The Random Bit Complexity of Mobile Robots Scattering
- A distributed algorithm for gathering many fat mobile robots in the plane
- Pattern Formation by Oblivious Asynchronous Mobile Robots
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
This page was built for publication:
