Forming sequences of geometric patterns with oblivious mobile robots
From MaRDI portal
Recommendations
Cites work
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Asynchronous pattern formation by anonymous oblivious mobile robots
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Coordination without communication: the case of the flocking problem
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Distributed computing by mobile robots: gathering
- Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.
- Distributed Models and Algorithms for Mobile Robot Systems
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
- Gathering of asynchronous robots with limited visibility
- scientific article; zbMATH DE number 1049494 (Why is no real title available?)
- Local spreading algorithms for autonomous robot systems
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
- Oracle-based flocking of mobile robots in crash-recovery model
- Pattern formation by mobile robots with limited visibility
- The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
Cited in
(33)- Terminating distributed construction of shapes and patterns in a fair solution of automata
- Distributed computing by mobile robots: uniform circle formation
- Team assembling problem for asynchronous heterogeneous mobile robots
- On the transformation capability of feasible mechanisms for programmable matter
- Arbitrary pattern formation on infinite regular tessellation graphs
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- Search by a metamorphic robotic system in a finite 2D square grid
- On fast pattern formation by autonomous robots
- Shape formation by programmable particles
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- Gathering robots in graphs: the central role of synchronicity
- Randomized gathering of asynchronous mobile robots
- Embedded pattern formation by asynchronous robots without chirality
- Asynchronous arbitrary pattern formation: the effects of a rigorous approach
- Universal systems of oblivious mobile robots
- Shape formation by programmable particles
- Connectivity preserving network transformers
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- On the computational power of oblivious robots
- Pattern formation by oblivious asynchronous mobile robots
- Mutual visibility by luminous robots without collisions
- Connectivity preserving network transformers
- Explicit communication among stigmergic robots
- A structured methodology for designing distributed algorithms for mobile entities
- Molecular pattern formation on grids in the \textsc{Moblot} model
- Compatibility of convergence algorithms for autonomous mobile robots (extended abstract)
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
- Minimum algorithm sizes for the gathering and related problems of autonomous mobile robots
- Compatibility of convergence algorithms for autonomous mobile robots
- The minimum algorithm size of k-grouping by silent oblivious robots
- On the computational power of mobile robots under sequential schedulers
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
This page was built for publication: Forming sequences of geometric patterns with oblivious mobile robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353251)
