2000 character limit reached
Stand Up Indulgent Rendezvous (2010.04400v1)
Published 9 Oct 2020 in cs.DC, cs.DS, and cs.NI
Abstract: We consider two mobile oblivious robots that evolve in a continuous Euclidean space. We require the two robots to solve the rendezvous problem (meeting in finite time at the same location, not known beforehand) despite the possibility that one of those robots crashes unpredictably. The rendezvous is stand up indulgent in the sense that when a crash occurs, the correct robot must still meet the crashed robot on its last position. We characterize the system assumptions that enable problem solvability, and present a series of algorithms that solve the problem for the possible cases.