Gathering asynchronous oblivious mobile robots in a ring
From MaRDI portal
Publication:2474070
Recommendations
- Gathering Asynchronous Oblivious Mobile Robots in a Ring
- How to gather asynchronous oblivious robots on anonymous rings
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- scientific article; zbMATH DE number 1688369
- Randomized gathering of asynchronous mobile robots
- Gathering asynchronous robots in the presence of obstacles
- Optimum Gathering of Asynchronous Robots
- Gathering of robots in a ring with mobile faults
- Gathering of asynchronous robots with limited visibility
Cites work
- Algorithms and Computation
- Asynchronous deterministic rendezvous in graphs
- Deterministic rendezvous in graphs
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Gathering of asynchronous robots with limited visibility
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 2038783 (Why is no real title available?)
- LATIN 2004: Theoretical Informatics
- LATIN 2004: Theoretical Informatics
- Structural Information and Communication Complexity
- Structural Information and Communication Complexity
Cited in
(78)- On asynchronous rendezvous in general graphs
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Gathering of robots in a ring with mobile faults
- Use of information, memory and randomization in asynchronous gathering
- Gathering identical autonomous systems on a circle using stigmergy
- How many oblivious robots can explore a line
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
- The topology of look-compute-move robot wait-free algorithms with hard termination
- Ring exploration with myopic luminous robots
- Gathering robots in graphs: the central role of synchronicity
- Randomized gathering of asynchronous mobile robots
- Leader election for anonymous asynchronous agents in arbitrary networks
- Gathering on rings under the look-compute-move model
- Searching for a non-adversarial, uncooperative agent on a cycle
- Partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings
- Gathering anonymous, oblivious robots on a grid
- Deterministic polynomial approach in the plane
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
- Gathering six oblivious robots on anonymous symmetric rings
- On the self-stabilization of mobile oblivious robots in uniform rings
- Anonymous meeting in networks
- scientific article; zbMATH DE number 1688369 (Why is no real title available?)
- About ungatherability of oblivious and asynchronous robots on anonymous rings
- Universal systems of oblivious mobile robots
- Optimal gathering of oblivious robots in anonymous graphs
- Gathering an even number of robots in an odd ring without global multiplicity detection
- Minmax-distance gathering on given meeting points
- Deterministic symmetric rendezvous in arbitrary graphs: overcoming anonymity, failures and uncertainty
- Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
- Optimum Gathering of Asynchronous Robots
- Gathering asynchronous robots in the presence of obstacles
- Network exploration by silent and oblivious robots
- Collisionless gathering of robots with an extent
- Distributed computing by mobile robots: gathering
- Asymptotically optimal deterministic rendezvous
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
- Mobile robots gathering algorithm with local weak multiplicity in rings
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
- Self-stabilizing gathering with strong multiplicity detection
- How to gather asynchronous oblivious robots on anonymous rings
- Leader election and gathering for asynchronous fat robots without common chirality
- Computing on rings by oblivious robots: a unified approach for different tasks
- Gathering over Meeting Nodes in Infinite Grid*
- Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
- Searching for a Non-adversarial, Uncooperative Agent on a Cycle
- Gathering Anonymous, Oblivious Robots on a Grid
- Optimal rendezvous on a line by location-aware robots in the presence of spies*
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- Gathering of oblivious robots on infinite grids with minimum traveled distance
- Gathering Asynchronous Oblivious Mobile Robots in a Ring
- Gathering of asynchronous robots with limited visibility
- Gathering in dynamic rings
- Optimal gathering by asynchronous oblivious robots in hypercubes
- Memory optimal dispersion by anonymous mobile robots
- Time optimal gathering of myopic robots on an infinite triangular grid
- Gracefully degrading gathering in dynamic rings
- Optimal Gathering Over Weber Meeting Nodes in Infinite Grid
- Partial Gathering of Mobile Robots from Multiplicity-Allowed Configurations in Rings
- Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
- Asynchronous deterministic rendezvous in bounded terrains
- Gathering on a circle with limited visibility by anonymous oblivious robots
- An environment for specifying and model checking mobile ring robot algorithms
- Stand-up indulgent gathering on lines
- Time optimal gathering of myopic robots on an infinite triangular grid
- Gathering on a circle with limited visibility by anonymous oblivious robots
- Want to gather? No need to chatter!
- On the broadcast problem for mobile agents in dynamic networks
- Optimal gathering of robots in anonymous butterfly networks via leader election
- Gathering on rings for myopic asynchronous robots with lights
- Of robot ants and elephants: a computational comparison
- Memory optimal dispersion by anonymous mobile robots
- Gathering of robots on anonymous grids and trees without multiplicity detection
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
This page was built for publication: Gathering asynchronous oblivious mobile robots in a ring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474070)
