Stand-Up Indulgent Gathering on Rings

We consider a collection of k ≥ 2 robots that evolve in a ring-shaped network without common orientation, and address a variant of the crash-tolerant gathering problem called the Stand-Up Indulgent Gathering (SUIG): given a collection of robots, if no robot crashes, robots have to meet at the same arbitrary location, not known beforehand, in finite time; if one robot or more robots crash on the same location, the remaining correct robots gather at the location of the crashed robots. We aim at characterizing the solvability of the SUIG problem without multiplicity detection capability.