Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Stand Up Indulgent Rendezvous

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.
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download
Contributor : Quentin Bramas <>
Submitted on : Thursday, October 8, 2020 - 12:16:00 PM
Last modification on : Monday, October 12, 2020 - 2:50:03 PM


  • HAL Id : hal-02961247, version 1
  • ARXIV : 2010.04400


Quentin Bramas, Anissa Lamani, Sébastien Tixeuil. Stand Up Indulgent Rendezvous. 2020. ⟨hal-02961247⟩



Record views


Files downloads