Computing on rings by oblivious robots: a unified approach for different tasks
From MaRDI portal
(Redirected from Publication:494795)
Recommendations
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Exclusive perpetual ring exploration without chirality
- Gathering on rings under the look-compute-move model
- How to gather asynchronous oblivious robots on anonymous rings
Cites work
- Almost optimal asynchronous rendezvous in infinite multidimensional grids
- An annotated bibliography on guaranteed graph searching
- Anonymous graph exploration without collision by mobile robots
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Distributed computing by mobile robots: gathering
- Energy-efficient strategies for building short chains of mobile robots locally
- Exclusive graph searching
- Exclusive perpetual ring exploration without chirality
- Gathering an even number of robots in an odd ring without global multiplicity detection
- Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
- Gathering asynchronous oblivious mobile robots in a ring
- Gathering few fat mobile robots in the plane
- Gathering of robots on anonymous grids and trees without multiplicity detection
- Gathering six oblivious robots on anonymous symmetric rings
- How to gather asynchronous oblivious robots on anonymous rings
- Impossibility of gathering by a set of autonomous mobile robots
- Label-guided graph exploration by a finite automaton
- Mobile robots gathering algorithm with local weak multiplicity in rings
- Monotonicity in graph searching
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- The cost of monotonicity in distributed graph searching
- The cost of probabilistic agreement in oblivious robot networks
- Tree exploration with logarithmic memory
Cited in
(16)- Fault-induced dynamics of oblivious robots on a line
- Model checking of robot gathering
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Gathering robots in graphs: the central role of synchronicity
- Exclusive perpetual ring exploration without chirality
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
- Parameterized verification of algorithms for oblivious robots on a ring
- Embedded pattern formation by asynchronous robots without chirality
- Computing without communicating: ring exploration by asynchronous oblivious robots
- An environment for specifying and model checking mobile ring robot algorithms
- On gathering of semi-synchronous robots in graphs
- Universal systems of oblivious mobile robots
- On the computational power of oblivious robots
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Optimal Gathering Over Weber Meeting Nodes in Infinite Grid
This page was built for publication: Computing on rings by oblivious robots: a unified approach for different tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494795)
