Pages that link to "Item:Q896693"
From MaRDI portal
The following pages link to Gathering of robots on anonymous grids and trees without multiplicity detection (Q896693):
Displaying 29 items.
- 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)
- Gathering of robots on anonymous grids and trees without multiplicity detection (Q896693) (← links)
- On asynchronous rendezvous in general graphs (Q1625604) (← links)
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (Q1699417) (← links)
- Arbitrary pattern formation on infinite regular tessellation graphs (Q2110359) (← links)
- Ring exploration with myopic luminous robots (Q2139099) (← links)
- Meeting in a polygon by anonymous oblivious robots (Q2204780) (← links)
- Gathering robots in graphs: the central role of synchronicity (Q2215970) (← links)
- Gathering on rings under the look-compute-move model (Q2256947) (← links)
- Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies (Q2303287) (← links)
- Gathering anonymous, oblivious robots on a grid (Q2310768) (← links)
- Embedded pattern formation by asynchronous robots without chirality (Q2318112) (← links)
- Deterministic rendezvous with different maps (Q2323344) (← links)
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings (Q2407627) (← links)
- Asynchronous arbitrary pattern formation: the effects of a rigorous approach (Q2422768) (← links)
- Mutual visibility on grid by asynchronous luminous robots (Q2672588) (← links)
- Universal Systems of Oblivious Mobile Robots (Q2835029) (← links)
- Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model (Q2961405) (← links)
- Gathering over Meeting Nodes in Infinite Grid* (Q5044391) (← links)
- Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots (Q6073893) (← links)
- Time optimal gathering of myopic robots on an infinite triangular grid (Q6155253) (← links)
- Optimal Gathering Over Weber Meeting Nodes in Infinite Grid (Q6169957) (← links)
- Non-crossing anonymous MAPF for tethered robots (Q6535407) (← links)
- On gathering of semi-synchronous robots in graphs (Q6536329) (← links)
- Stand-up indulgent gathering on lines (Q6614023) (← links)
- Time optimal gathering of myopic robots on an infinite triangular grid (Q6652437) (← links)
- Parking problem by oblivious mobile robots in infinite grids (Q6652442) (← links)