Asynchronous Indulgent Gathering of Opaque Robots
This research investigates gathering robots under mobility faults and asynchrony using light constraints (LUMI model). It proves that gathering is impossible with only two colors but provides deterministic solutions using 3, 7, or 26 colors. The study offers algorithms with specific time-color trade-offs, showing how to solve the problem even when robots are obstructed.