We consider a swarm of mobile robots evolving in bidimensional Euclidean space. study the stronger variant crash-tolerant gathering: if no robot crashes, have to meet at same arbitrary location, not known beforehand, finite time; one or several crash remaining correct gather location rescue them. Motivated by impossibility results semi-synchronous setting, we present first solution problem for ...