Work

Stand Up Indulgent Rendezvous

Year: 2020

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2010.04400

Authors: Bramas, Quentin, Lamani, Anissa, Tixeuil, Sébastien

Institutions: Laboratoire des Sciences de l'Ingénieur, de l'Informatique et de l'Imagerie, Université de Strasbourg

Language: English

Topic: Optimization and Search Problems

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W3092032002

Cites: 15

Cited by:

Related to: 10