On the self-stabilization of mobile oblivious robots in uniform rings
From MaRDI portal
Publication:2513610
DOI10.1016/j.tcs.2014.12.008zbMath1312.68196OpenAlexW2150194088MaRDI QIDQ2513610
Sébastien Tixeuil, Fukuhito Ooshita
Publication date: 28 January 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.12.008
Distributed systems (68M14) Artificial intelligence for robotics (68T40) Agent technology and artificial intelligence (68T42)
Related Items (2)
Gathering robots in graphs: the central role of synchronicity ⋮ Universal Systems of Oblivious Mobile Robots
Cites Work
- Gathering fat mobile robots with slim omnidirectional cameras
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Self-stabilizing gathering with strong multiplicity detection
- Gathering of asynchronous robots with limited visibility
- Uniform multi-agent deployment on a ring
- The cost of probabilistic agreement in oblivious robot networks
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Gathering on rings under the look-compute-move model
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Gathering asynchronous oblivious mobile robots in a ring
- Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection
- Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- A distributed algorithm for gathering many fat mobile robots in the plane
This page was built for publication: On the self-stabilization of mobile oblivious robots in uniform rings