On asynchronous rendezvous in general graphs

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.

Authors

• Evangelos Bampas
• Lélia Blin
• Jurek Czyzowicz
• David Ilcinkas
• Arnaud Labourel
• Maria Potop-Butucaru
• Sébastien Tixeuil

Keywords

• Distributed algorithms
• Asynchronous
• Mobile agents
• General graphs
• Rendezvous