Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
From MaRDI portal
Publication:955018
DOI10.1016/j.tcs.2008.07.026zbMath1152.68053MaRDI QIDQ955018
Peter Widmayer, Nicola Santoro, Paola Flocchini, Giuseppe Prencipe
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.07.026
Related Items
Unnamed Item, Exploration of High-Dimensional Grids by Finite Automata, Pattern Formation by Oblivious Asynchronous Mobile Robots, Explicit Communication Among Stigmergic Robots, Computing by Mobile Robotic Sensors, Arbitrary pattern formation by asynchronous opaque robots with lights, Arbitrary pattern formation on infinite grid by asynchronous oblivious robots, A circuit basis for morphogenesis, Optimal probabilistic ring exploration by semi-synchronous oblivious robots, Deterministic geoleader election in disoriented anonymous systems, Leader election and gathering for asynchronous fat robots without common chirality, Position discovery for a system of bouncing robots, Mutual visibility by luminous robots without collisions, Getting close without touching: near-gathering for autonomous mobile robots, Autonomous mobile robots with lights, Remembering without memory: tree exploration by asynchronous oblivious robots, Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane, Distributed computing by mobile robots: uniform circle formation, Team assembling problem for asynchronous heterogeneous mobile robots, Communication and location discovery in geometric ring networks, How many oblivious robots can explore a line, On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis, Arbitrary pattern formation on infinite regular tessellation graphs, TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications, On fast pattern formation by autonomous robots, \(k\)-circle formation by disoriented asynchronous robots, Shape formation by programmable particles, Gathering robots in graphs: the central role of synchronicity, Embedded pattern formation by asynchronous robots without chirality, Forming sequences of geometric patterns with oblivious mobile robots, Computing without communicating: ring exploration by asynchronous oblivious robots, Asynchronous arbitrary pattern formation: the effects of a rigorous approach, Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement, Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement, Pattern Formation by Mobile Robots with Limited Visibility, Leader Election and Shape Formation with Self-organizing Programmable Matter, UNIFORM SCATTERING OF AUTONOMOUS MOBILE ROBOTS IN A GRID, Network Exploration by Silent and Oblivious Robots, Shape formation by programmable particles, Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gathering of asynchronous robots with limited visibility
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- On Synchronous Robotic Networks—Part II: Time Complexity of Rendezvous and Deployment Algorithms
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
