Pages that link to "Item:Q1008735"
From MaRDI portal
The following pages link to Distributed algorithms for partitioning a swarm of autonomous mobile robots (Q1008735):
Displaying 9 items.
- Geometric computations by broadcasting automata (Q256432) (← links)
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots (Q391193) (← links)
- Leader election and gathering for asynchronous fat robots without common chirality (Q491635) (← links)
- Team assembling problem for asynchronous heterogeneous mobile robots (Q1704590) (← links)
- \(k\)-circle formation by disoriented asynchronous robots (Q2143129) (← links)
- Gathering Asynchronous Robots in the Presence of Obstacles (Q2980916) (← links)
- Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots (Q3408171) (← links)
- Polygon Approximations of the Euclidean Circles on the Square Grid by Broadcasting Sequences (Q5237090) (← links)
- Parking problem by oblivious mobile robots in infinite grids (Q6652442) (← links)
