Pages that link to "Item:Q1699417"
From MaRDI portal
The following pages link to Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (Q1699417):
Displaying 9 items.
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane (Q1627966) (← links)
- On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis (Q2097333) (← links)
- Arbitrary pattern formation on infinite regular tessellation graphs (Q2110359) (← links)
- \(k\)-circle formation by disoriented asynchronous robots (Q2143129) (← links)
- Gathering robots in graphs: the central role of synchronicity (Q2215970) (← links)
- Embedded pattern formation by asynchronous robots without chirality (Q2318112) (← links)
- Gathering over Meeting Nodes in Infinite Grid* (Q5044391) (← links)
- Near-gathering of energy-constrained mobile agents (Q5919042) (← links)
- Optimal Gathering Over Weber Meeting Nodes in Infinite Grid (Q6169957) (← links)
