Pattern Formation by Oblivious Asynchronous Mobile Robots
From MaRDI portal
Publication:5258906
DOI10.1137/140958682zbMath1325.68230OpenAlexW627224437MaRDI QIDQ5258906
Hirotaka Ono, Nao Fujinaga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
Publication date: 24 June 2015
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140958682
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14) Artificial intelligence for robotics (68T40)
Related Items (22)
TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications ⋮ Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane ⋮ Search by a metamorphic robotic system in a finite 2D square grid ⋮ On fast pattern formation by autonomous robots ⋮ Ring exploration with myopic luminous robots ⋮ Shape formation by programmable particles ⋮ Plane formation by synchronous mobile robots without chirality ⋮ Distributed computing by mobile robots: uniform circle formation ⋮ A structured methodology for designing distributed algorithms for mobile entities ⋮ Asynchronous arbitrary pattern formation: the effects of a rigorous approach ⋮ Molecular pattern formation on grids in the \textsc{Moblot} model ⋮ Optimally reordering mobile agents on parallel rows ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Shape formation by programmable particles ⋮ Team assembling problem for asynchronous heterogeneous mobile robots ⋮ Unnamed Item ⋮ Distributed transformations of Hamiltonian shapes based on line moves ⋮ Arbitrary pattern formation by asynchronous opaque robots with lights ⋮ Arbitrary pattern formation on infinite grid by asynchronous oblivious robots ⋮ Fault-induced dynamics of oblivious robots on a line ⋮ Embedded pattern formation by asynchronous robots without chirality ⋮ On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The optimal tolerance of uniform observation error for mobile robot convergence
- Gathering of asynchronous robots with limited visibility
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Gathering few fat mobile robots in the plane
- Matching theory
- Plane elementary bipartite graphs
- Rendezvous of two robots with visible bits
- Impossibility of gathering by a set of autonomous mobile robots
- Rendezvous of Two Robots with Constant Memory
- Pattern Formation by Mobile Robots with Limited Visibility
- The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
- Distributed Computing by Mobile Robots: Gathering
- Leader Election Problem versus Pattern Formation Problem
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- A distributed algorithm for gathering many fat mobile robots in the plane
- On the computational power of oblivious robots
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
This page was built for publication: Pattern Formation by Oblivious Asynchronous Mobile Robots
