Universal pattern formation by oblivious robots under sequential schedulers
From MaRDI portal
Cites work
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Asynchronous arbitrary pattern formation: the effects of a rigorous approach
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Computational power of autonomous robots: transparency vs. opaqueness
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Distributed computing by mobile robots: gathering
- Distributed computing by mobile robots: uniform circle formation
- Embedded pattern formation by asynchronous robots without chirality
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Flocking with oblivious robots
- scientific article; zbMATH DE number 1629980 (Why is no real title available?)
- Impossibility of gathering by a set of autonomous mobile robots
- Leader election problem versus pattern formation problem
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
- Oblivious robots under round robin: gathering on rings
- On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
- Randomized gathering of asynchronous mobile robots
- The gathering problem for two oblivious robots with unreliable compasses
This page was built for publication: Universal pattern formation by oblivious robots under sequential schedulers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241991)
