Stand Up Indulgent Rendezvous - Laboratoire d'Informatique de Paris 6 Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2020

Stand Up Indulgent Rendezvous

Résumé

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.
Fichier principal
Vignette du fichier
Stand_Up_Indulgent_Rendez_vous.pdf (285.3 Ko) Télécharger le fichier
main.pdf (282.63 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02961247 , version 1 (08-10-2020)

Identifiants

Citer

Quentin Bramas, Anissa Lamani, Sébastien Tixeuil. Stand Up Indulgent Rendezvous. 2020. ⟨hal-02961247⟩
75 Consultations
79 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More