Uniform deployment on a ring
Robots on a circle must spread out to equal spacing.
Problem statement and measuresexpand
\(n\) robots on a ring (a circle of length \(L\)) must reach positions at equal distance \(d=L/n\) from their neighbours (the next robots along the ring in either direction) and stop. Spreading on a segment is the one-dimensional analogue.
Measures: Time, rounds (FSYNC, SSYNC) or epochs (ASYNC) until the task is done; "finite" when only solvability is known; Colours, colours of the light per robot (0 for oblivious robots).
Progress map
tight near-optimal polynomial gap unknown impossible· rows follow the assumption tree; each cell: best upper bound vs lower bound, and what forces the lower bound
Setting
Time
Colours
Oriented ring, asynchronous, oblivious + point, + unlimited visibility, + transparent, + no faults, + chirality
1 open · 1 results
unknown
\(\text{finite}\) vs \(\text{impossible}\)
symmetry
tight
\(0\) vs —
Know a better result, or found a mistake? Suggest a result · Report an error. Accepted contributions are acknowledged.