Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots

DOI10.1007/978-3-642-11476-2_16zbMath1274.68566OpenAlexW2568618676MaRDI QIDQ3408171

Stéphane Devismes, Sébastien Tixeuil, Franck Petit

Publication date: 24 February 2010

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11476-2_16

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Agent technology and artificial intelligence (68T42)

Related Items (8)

Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ Gathering of robots on anonymous grids and trees without multiplicity detection ⋮ Uniform multi-agent deployment on a ring ⋮ Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model ⋮ Computing on rings by oblivious robots: a unified approach for different tasks ⋮ Network Exploration by Silent and Oblivious Robots ⋮ Synchronous robots vs asynchronous lights-enhanced robots on graphs

Cites Work

• Optimal probabilistic ring exploration by semi-synchronous oblivious robots
• Gathering of asynchronous robots with limited visibility
• Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
• Distributed algorithms for partitioning a swarm of autonomous mobile robots
• Gathering asynchronous oblivious mobile robots in a ring
• Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns

This page was built for publication: Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots