Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1629980 (Why is no real title available?)
- scientific article; zbMATH DE number 1049494 (Why is no real title available?)
- scientific article; zbMATH DE number 2038783 (Why is no real title available?)
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Gathering of asynchronous robots with limited visibility
- On Synchronous Robotic Networks—Part II: Time Complexity of Rendezvous and Deployment Algorithms
- The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
Cited in
(51)- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Deterministic geoleader election in disoriented anonymous systems
- Molecular pattern formation on grids in the \textsc{Moblot} model
- On the computational power of oblivious robots
- Gathering robots in graphs: the central role of synchronicity
- Arbitrary pattern formation on infinite regular tessellation graphs
- Communication and location discovery in geometric ring networks
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Remembering without memory: tree exploration by asynchronous oblivious robots
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- Computing by mobile robotic sensors
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Leader election and shape formation with self-organizing programmable matter
- A circuit basis for morphogenesis
- A structured methodology for designing distributed algorithms for mobile entities
- Leader election problem versus pattern formation problem
- How many oblivious robots can explore a line
- Pattern formation by oblivious asynchronous mobile robots
- Leader election and gathering for asynchronous fat robots without common chirality
- Explicit communication among stigmergic robots
- \(k\)-circle formation by disoriented asynchronous robots
- On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- Shape formation by programmable particles
- Forming sequences of geometric patterns with oblivious mobile robots
- Getting close without touching: near-gathering for autonomous mobile robots
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Autonomous mobile robots with lights
- Arbitrary pattern formation on a continuous circle by oblivious robot swarm
- Shape formation by programmable particles
- On fast pattern formation by autonomous robots
- Arbitrary pattern formation by opaque fat robots with lights
- Distributed computing by mobile robots: uniform circle formation
- Embedded pattern formation by asynchronous robots without chirality
- Exploration of High-Dimensional Grids by Finite State Machines
- Exploration of High-Dimensional Grids by Finite Automata
- Asynchronous arbitrary pattern formation: the effects of a rigorous approach
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Parking problem by oblivious mobile robots in infinite grids
- Position discovery for a system of bouncing robots
- Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement
- Team assembling problem for asynchronous heterogeneous mobile robots
- Uniform scattering of autonomous mobile robots in a grid
- Pattern formation by mobile robots with limited visibility
- Evacuation of equilateral triangles by mobile agents of limited communication range
- Stationary and deterministic leader election in self-organizing particle systems
- Network exploration by silent and oblivious robots
- scientific article; zbMATH DE number 1629980 (Why is no real title available?)
- On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis
- scientific article; zbMATH DE number 2044499 (Why is no real title available?)
- Mutual visibility by luminous robots without collisions
This page was built for publication: Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q955018)
