Optimal probabilistic ring exploration by semi-synchronous oblivious robots
DOI10.1016/J.TCS.2013.05.031zbMATH Open1295.68195OpenAlexW2105366160MaRDI QIDQ391193FDOQ391193
Authors: Stéphane Devismes, Franck Petit, 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
Recommendations
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Optimal deterministic ring exploration with oblivious asynchronous robots
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Optimal torus exploration by oblivious robots
- Exclusive perpetual ring exploration without chirality
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Artificial intelligence for robotics (68T40) Agent technology and artificial intelligence (68T42)
Cites Work
- Distributed algorithms for partitioning a swarm of autonomous mobile robots
- Gathering asynchronous oblivious mobile robots in a ring
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Gathering of asynchronous robots with limited visibility
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Network exploration by silent and oblivious robots
- How many oblivious robots can explore a line
- Mobile robots gathering algorithm with local weak multiplicity in rings
- Optimal deterministic ring exploration with oblivious asynchronous robots
- Title not available (Why is that?)
- Optimal Byzantine-resilient convergence in uni-dimensional robot networks
Cited In (18)
- Exclusive perpetual ring exploration without chirality
- On the self-stabilization of mobile oblivious robots in uniform rings
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Ring exploration of myopic luminous robots with visibility more than one
- Optimal deterministic ring exploration with oblivious asynchronous robots
- Explicit communication among stigmergic robots
- Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality
- Ring exploration with myopic luminous robots
- Optimal torus exploration by oblivious robots
- Universal systems of oblivious mobile robots
- Distributed exploration of dynamic rings
- Grid exploration by a swarm of autonomous robots with minimum repetitions
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Parameterized verification of algorithms for oblivious robots on a ring
- Perpetual torus exploration by myopic luminous robots
- Perpetual torus exploration by myopic luminous robots
- Ring exploration of myopic luminous robots with visibility more than one
- An environment for specifying and model checking mobile ring robot algorithms
This page was built for publication: Optimal probabilistic ring exploration by semi-synchronous oblivious robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391193)
