Separation
Robots of different (hidden) colours must separate so that each colour class occupies its own region.
Problem statement and measuresexpand
Each robot has a fixed colour that the others can see but it cannot (an unconscious robot). The robots must arrange themselves so that the colour classes (the sets of robots of one colour) are separated (into points, lines or circles, depending on the variant).
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
unknown
\(\text{finite}\) vs \(\text{impossible}\)
symmetry
tight
\(0\) vs —
unknown
\(O(n)\) vs —
tight
\(0\) vs —
Know a better result, or found a mistake? Suggest a result · Report an error. Accepted contributions are acknowledged.