Pages that link to "Item:Q528200"
From MaRDI portal
The following pages link to Gathering of oblivious robots on infinite grids with minimum traveled distance (Q528200):
Displaying 16 items.
- A unified approach for gathering and exclusive searching on rings under weak assumptions (Q518678) (← links)
- Synchronous robots vs asynchronous lights-enhanced robots on graphs (Q737100) (← links)
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane (Q1627966) (← links)
- Arbitrary pattern formation on infinite regular tessellation graphs (Q2110359) (← links)
- Gathering robots in graphs: the central role of synchronicity (Q2215970) (← 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)
- The general position number of integer lattices (Q2660838) (← links)
- Mutual visibility on grid by asynchronous luminous robots (Q2672588) (← links)
- Grid exploration by a swarm of autonomous robots with minimum repetitions (Q2676467) (← links)
- Gathering over Meeting Nodes in Infinite Grid* (Q5044391) (← links)
- Arbitrary pattern formation on infinite grid by asynchronous oblivious robots (Q5919533) (← links)
- Optimal Gathering Over Weber Meeting Nodes in Infinite Grid (Q6169957) (← links)
- On gathering of semi-synchronous robots in graphs (Q6536329) (← links)
- Parking problem by oblivious mobile robots in infinite grids (Q6652442) (← links)
