Pages that link to "Item:Q2474070"
From MaRDI portal
The following pages link to Gathering asynchronous oblivious mobile robots in a ring (Q2474070):
Displaying 50 items.
- Anonymous meeting in networks (Q262278) (← links)
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots (Q391193) (← links)
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs (Q392198) (← links)
- Self-stabilizing gathering with strong multiplicity detection (Q418745) (← links)
- Leader election and gathering for asynchronous fat robots without common chirality (Q491635) (← links)
- Computing on rings by oblivious robots: a unified approach for different tasks (Q494795) (← links)
- A unified approach for gathering and exclusive searching on rings under weak assumptions (Q518678) (← links)
- Gathering of oblivious robots on infinite grids with minimum traveled distance (Q528200) (← links)
- Asynchronous deterministic rendezvous in bounded terrains (Q650932) (← links)
- Of robot ants and elephants: a computational comparison (Q719319) (← links)
- Memory optimal dispersion by anonymous mobile robots (Q831752) (← links)
- Gathering of robots on anonymous grids and trees without multiplicity detection (Q896693) (← links)
- Remembering without memory: tree exploration by asynchronous oblivious robots (Q962164) (← links)
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring (Q986558) (← links)
- On asynchronous rendezvous in general graphs (Q1625604) (← links)
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane (Q1627966) (← links)
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (Q1699417) (← links)
- Gathering identical autonomous systems on a circle using stigmergy (Q1938388) (← links)
- How many oblivious robots can explore a line (Q1944194) (← links)
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains (Q1946493) (← links)
- The topology of look-compute-move robot wait-free algorithms with hard termination (Q2002056) (← links)
- Ring exploration with myopic luminous robots (Q2139099) (← links)
- Gathering robots in graphs: the central role of synchronicity (Q2215970) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Gathering on rings under the look-compute-move model (Q2256947) (← links)
- Searching for a non-adversarial, uncooperative agent on a cycle (Q2285151) (← links)
- Gathering anonymous, oblivious robots on a grid (Q2310768) (← links)
- Deterministic polynomial approach in the plane (Q2353250) (← links)
- Computing without communicating: ring exploration by asynchronous oblivious robots (Q2392925) (← links)
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings (Q2407627) (← links)
- Gathering six oblivious robots on anonymous symmetric rings (Q2447532) (← links)
- On the self-stabilization of mobile oblivious robots in uniform rings (Q2513610) (← links)
- Universal Systems of Oblivious Mobile Robots (Q2835029) (← links)
- Optimal Gathering of Oblivious Robots in Anonymous Graphs (Q2868646) (← links)
- MinMax-Distance Gathering on Given Meeting Points (Q2947015) (← links)
- Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty (Q2961404) (← links)
- Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model (Q2961405) (← links)
- Network Exploration by Silent and Oblivious Robots (Q3057626) (← links)
- Collisionless Gathering of Robots with an Extent (Q3075515) (← links)
- ASYMPTOTICALLY OPTIMAL DETERMINISTIC RENDEZVOUS (Q3173941) (← links)
- Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots (Q3408171) (← links)
- Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots (Q3511387) (← links)
- Gathering over Meeting Nodes in Infinite Grid* (Q5044391) (← links)
- Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults (Q5056052) (← links)
- Searching for a Non-adversarial, Uncooperative Agent on a Cycle (Q5056057) (← links)
- Gathering Anonymous, Oblivious Robots on a Grid (Q5056061) (← links)
- Optimal rendezvous on a line by location-aware robots in the presence of spies* (Q5057736) (← links)
- Gathering in dynamic rings (Q5919424) (← links)
- Memory optimal dispersion by anonymous mobile robots (Q6094723) (← links)
- Time optimal gathering of myopic robots on an infinite triangular grid (Q6155253) (← links)