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 + |L max |)3) if D is unknown, where |L min | and |L max | 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|L min |), if the size n of the ring is known, and of cost O(n|L max |), 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.
KeywordsMobile Agent Port Number Arbitrary Graph Central Edge Unknown Size
Unable to display preview. Download preview PDF.
- 1.Aleliunas, R., Karp, R.M., Lipton, R.J., Lovász, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: Proc. FOCS 1979, pp. 218–223 (1979)Google Scholar
- 4.Alpern, S., Gal, S.: The theory of search games and rendezvous. In: Int. Series in Operations research and Management Science, Kluwer Academic Publisher, Dordrecht (2002)Google Scholar
- 9.Anderson, E., Fekete, S.: Asymmetric rendezvous on the plane. In: Proc. 14th Annual ACM Symp. on Computational Geometry (1998)Google Scholar
- 14.Coppersmith, D., Doyle, P., Raghavan, P., Snir, M.: Random walks on weighted graphs, and applications to on-line algorithms. In: Proc. STOC 1990, pp. 369–378.Google Scholar
- 17.Dyer, M., Frieze, A., Kannan, R.: A random polynomial time algorithm for estimating volumes of convex bodies. In: Proc. 21st Annual ACM Symposium on Theory of Computing (STOC 1989), pp. 375–381 (1989)Google Scholar
- 20.Israeli, A., Jalfon, M.: Token management schemes and random walks yield self stabilizing mutual exclusion. In: Proc. PODC 1990, pp. 119–131 (1990)Google Scholar
- 22.Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proc. 23rd International Conference on Distributed Computing Systems (ICDCS 2003), pp. 592–599 (2003)Google Scholar
- 24.Schelling, T.: The strategy of conflict. Oxford University Press, Oxford (1960)Google Scholar
- 26.Yu, X., Yung, M.: Agent rendezvous: a dynamic symmetry-breaking problem. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 610–621. Springer, Heidelberg (1996)Google Scholar