Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
From MaRDI portal
(Redirected from Publication:986558)
Recommendations
Cites work
- scientific article; zbMATH DE number 2038783 (Why is no real title available?)
- Algorithms and Computation
- Asynchronous deterministic rendezvous in graphs
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Deterministic rendezvous in graphs
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Gathering asynchronous oblivious mobile robots in a ring
- Gathering of asynchronous robots with limited visibility
- Impossibility of gathering by a set of autonomous mobile robots
- LATIN 2004: Theoretical Informatics
- LATIN 2004: Theoretical Informatics
- Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
- SOFSEM 2006: Theory and Practice of Computer Science
- Structural Information and Communication Complexity
Cited in
(41)- Ring exploration of myopic luminous robots with visibility more than one
- Ring exploration with myopic luminous robots
- Computing on rings by oblivious robots: a unified approach for different tasks
- Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
- Ring exploration of myopic luminous robots with visibility more than one
- Memory optimal dispersion by anonymous mobile robots
- Memory optimal dispersion by anonymous mobile robots
- Optimal gathering of oblivious robots in anonymous graphs
- On asynchronous rendezvous in general graphs
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Deterministic polynomial approach in the plane
- Gathering robots in graphs: the central role of synchronicity
- Gathering over Meeting Nodes in Infinite Grid*
- Stand-up indulgent gathering on lines
- Distributed graph searching with a sense of direction
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
- How many oblivious robots can explore a line
- On the self-stabilization of mobile oblivious robots in uniform rings
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
- Embedded pattern formation by asynchronous robots without chirality
- Computing without communicating: ring exploration by asynchronous oblivious robots
- On gathering of semi-synchronous robots in graphs
- Universal systems of oblivious mobile robots
- Gathering asynchronous oblivious mobile robots in a ring
- Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies
- Time optimal gathering of myopic robots on an infinite triangular grid
- Gathering on rings under the look-compute-move model
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- Optimal torus exploration by oblivious robots
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Optimum Gathering of Asynchronous Robots
- Time optimal gathering of myopic robots on an infinite triangular grid
- Leader election for anonymous asynchronous agents in arbitrary networks
- Anonymous meeting in networks
- Gathering of oblivious robots on infinite grids with minimum traveled distance
- Asynchronous deterministic rendezvous in bounded terrains
- Gathering of robots on anonymous grids and trees without multiplicity detection
- Gathering Asynchronous Oblivious Mobile Robots in a Ring
- Gathering six oblivious robots on anonymous symmetric rings
This page was built for publication: Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q986558)
