Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
From MaRDI portal
Publication:924138
DOI10.1016/J.TCS.2008.01.050zbMath1146.68462OpenAlexW1965243636MaRDI QIDQ924138
Publication date: 28 May 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.050
Distributed systems (68M14) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Related Items (17)
On fast pattern formation by autonomous robots ⋮ \(k\)-circle formation by disoriented asynchronous robots ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ Distributed computing by mobile robots: uniform circle formation ⋮ Leader Election and Shape Formation with Self-organizing Programmable Matter ⋮ Decoupled design of distributed event-triggered circle formation control for multi-agent system ⋮ Autonomous mobile robots with lights ⋮ Uniform multi-agent deployment on a ring ⋮ How many oblivious robots can explore a line ⋮ Controlling anonymous mobile agents with unidirectional locomotion to form formations on a circle ⋮ Computing by Mobile Robotic Sensors ⋮ UNIFORM SCATTERING OF AUTONOMOUS MOBILE ROBOTS IN A GRID ⋮ Mutual visibility by luminous robots without collisions ⋮ Universal coating for programmable matter ⋮ Network Exploration by Silent and Oblivious Robots ⋮ Getting close without touching: near-gathering for autonomous mobile robots ⋮ Forming sequences of geometric patterns with oblivious mobile robots
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gathering of asynchronous robots with limited visibility
- Circle formation of weak robots and Lyndon words
- Self-deployment of mobile sensors on a ring
- Coordination without communication: the case of the flocking problem
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Swing Words to Make Circle Formation Quiescent
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Distributed Computing – IWDC 2005
- Structural Information and Communication Complexity
- Structural Information and Communication Complexity
This page was built for publication: Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity