Optimal probabilistic ring exploration by semi-synchronous oblivious robots

DOI10.1016/j.tcs.2013.05.031zbMath1295.68195OpenAlexW2105366160MaRDI QIDQ391193

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

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.031

zbMATH Keywords

probabilistic algorithmmobile robotsobliviousnessring exploration

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Agent technology and artificial intelligence (68T42) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (11)

Ring exploration with myopic luminous robots ⋮ Ring exploration of myopic luminous robots with visibility more than one ⋮ Grid exploration by a swarm of autonomous robots with minimum repetitions ⋮ Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality ⋮ Perpetual torus exploration by myopic luminous robots ⋮ Perpetual torus exploration by myopic luminous robots ⋮ Optimal torus exploration by oblivious robots ⋮ Explicit Communication Among Stigmergic Robots ⋮ On the self-stabilization of mobile oblivious robots in uniform rings ⋮ Universal Systems of Oblivious Mobile Robots ⋮ Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots

Cites Work

• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
• Remembering without memory: tree exploration by asynchronous oblivious robots
• Optimal Byzantine-resilient convergence in uni-dimensional robot networks
• Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
• Distributed algorithms for partitioning a swarm of autonomous mobile robots
• How many oblivious robots can explore a line
• Gathering asynchronous oblivious mobile robots in a ring
• Network Exploration by Silent and Oblivious Robots
• Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings
• Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns

This page was built for publication: Optimal probabilistic ring exploration by semi-synchronous oblivious robots