Asynchronous deterministic rendezvous in graphs
Two mobile agents (robots) having distinct labels and located in nodes of an unknown anonymous connected graph, have to meet. We consider the asynchronous version of this well-studied rendezvous problem and we seek fast deterministic algorithms for it. Since in the asynchronous setting meeting at a node, which is normally required in rendezvous, is in general impossible, we relax the demand by allowing meeting of the agents inside an edge as well. The measure of performance of a rendezvous algorithm is its cost: for a given initial location of agents in a graph, this is the number of edge traversals of both agents until rendezvous is achieved. If agents are initially situated at a distance D in an infinite line, we show a rendezvous algorithm with cost O(D|L min|2) when D is known and O((D + |Lmax|) 3) if D is unknown, where |Lmin| and |Lmax| are the lengths of the shorter and longer label of the agents, respectively. These results still hold for the case of the ring of unknown size but then we also give an optimal algorithm of cost O(n|Lmin|), if the size n of the ring is known, and of cost O(n|Lmax|), if it is unknown. For arbitrary graphs, we show that rendezvous is feasible if an upper bound on the size of the graph is known and we give an optimal algorithm of cost O(D|L min|) if the topology of the graph and the initial positions are known to agents.
|Conference||30th International Symposium on Mathematical Foundations of Computer Science 2005, MFCS 2005|
De Marco, G. (Gianluca), Gargano, L. (Luisa), Kranakis, E, Krizanc, D. (Danny), Pelc, A. (Andrzej), & Vaccaro, U. (Ugo). (2005). Asynchronous deterministic rendezvous in graphs. Presented at the 30th International Symposium on Mathematical Foundations of Computer Science 2005, MFCS 2005.