On asynchronous rendezvous in general graphs

Abstract : A pair of agents (robots) are moving in a graph with the goal of meeting at the same node or while traversing the same edge. An asynchronous adversary knows the prescribed walks of the two agents and is in complete control of the speed of each agent during its walk. We provide a complete characterization of pairs of walks that enforce rendezvous against an asynchronous adversary after traversing a given number of edges. The characterization is efficient in that it can be checked in polynomial time. We argue that the certificate of rendezvous enforcement that is produced by the checking algorithm contains a wealth of information on why rendezvous is enforced.
Document type :
Journal articles
Theoretical Computer Science, Elsevier, In press, 〈10.1016/j.tcs.2018.06.045〉
Liste complète des métadonnées

https://hal.sorbonne-universite.fr/hal-01900843
Contributor : Lélia Blin <>
Submitted on : Monday, October 22, 2018 - 2:59:13 PM
Last modification on : Friday, November 16, 2018 - 2:20:32 AM

File

revised_TCS.pdf
Files produced by the author(s)

Identifiers

Citation

Evangelos Bampas, Lélia Blin, Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, et al.. On asynchronous rendezvous in general graphs. Theoretical Computer Science, Elsevier, In press, 〈10.1016/j.tcs.2018.06.045〉. 〈hal-01900843〉

Share

Metrics

Record views

1