Team assembling problem for asynchronous heterogeneous mobile robots
From MaRDI portal
Publication:1704590
DOI10.1016/j.tcs.2018.01.009zbMath1388.68275OpenAlexW2792496511MaRDI QIDQ1704590
Shuji Kijima, Masafumi Yamashita, Yukiko Yamauchi, Zhi-Qiang Liu
Publication date: 12 March 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.01.009
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14) Artificial intelligence for robotics (68T40)
Related Items
Search by a metamorphic robotic system in a finite 2D square grid ⋮ \(k\)-circle formation by disoriented asynchronous robots ⋮ Molecular pattern formation on grids in the \textsc{Moblot} model ⋮ Arbitrary pattern formation on infinite grid by asynchronous oblivious robots
Cites Work
- Unnamed Item
- 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
- Distributed algorithms for partitioning a swarm of autonomous mobile robots
- Plane formation by synchronous mobile robots in the three dimensional Euclidean space
- Coordination without communication: the case of the flocking problem
- Forming sequences of geometric patterns with oblivious mobile robots
- Rendezvous of Two Robots with Constant Memory
- Pattern Formation by Mobile Robots with Limited Visibility
- Distributed Computing by Mobile Robots: Gathering
- Self-stabilizing systems in spite of distributed control
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- A distributed algorithm for gathering many fat mobile robots in the plane
- Pattern Formation by Oblivious Asynchronous Mobile Robots
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Brief Announcement
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
