On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis
From MaRDI portal
Publication:2097333
DOI10.1007/978-3-031-09993-9_3OpenAlexW4285124663MaRDI QIDQ2097333
Publication date: 11 November 2022
Full work available at URL: https://arxiv.org/abs/2203.06546
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Related Items (1)
Cites Work
- Unnamed Item
- Mutual visibility by luminous robots without collisions
- Gathering of asynchronous robots with limited visibility
- Autonomous mobile robots with lights
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Plane formation by synchronous mobile robots in the three dimensional Euclidean space
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Coordination without communication: the case of the flocking problem
- Rendezvous of two robots with visible bits
- Complete visibility for robots with lights in \(\mathrm{O}(1)\) time
- The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
- Distributed Computing by Mobile Robots: Gathering
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Pattern Formation by Oblivious Asynchronous Mobile Robots
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Computing by Mobile Robotic Sensors
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Rendezvous with constant memory
This page was built for publication: On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis
