Optimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring
We study the rendezvous problem with k≥2 mobile agents in a n-node ring. We present a new algorithm which solves the rendezvous problem for any non-periodic distribution of agents on the ring. The mobile agents require the use of O(log k)–bit-wise size of internal memory and one indistinguishable token each. In the periodic (but not symmetric) case our new procedure allows the agents to conclude that rendezvous is not feasible. It is known that in the symmetric case the agents cannot decide the feasibility of rendezvous if their internal memory is limited to ω(loglog n) bits, see . In this context we show new space optimal deterministic algorithm allowing effective recognition of the symmetric case. The algorithm is based on O(log k + loglog n)-bit internal memory and a single token provided to each mobile agent. Finally, it is known that both in the periodic as well as in the symmetric cases the rendezvous cannot be accomplished by any deterministic procedure due to problems with breaking symmetry.
Unable to display preview. Download preview PDF.
- 2.Alpern, S.: Rendezvous Search: A Personal Perspective. LSE Research Report, CDAM-2000-05, London School of Economics (2000)Google Scholar
- 4.Alpern, S., Howard, J.V.: Alternating Search at Two Locations. LSE OR Working Paper, 99.30 (1999)Google Scholar
- 5.Alpern, S., Reyniers, D.: The Rendezvous and Coordinated Search Problems. Proceedings of the 33rd Conference on Decision and Control, Lake Buena Vista, FL (December 1994)Google Scholar
- 9.Apostol, T.M.: Introduction to Analytical Number Theory. Springer, Heidelberg (1997)Google Scholar
- 12.Chester, E., Tutuncu, R.: Rendezvous Search on the Labeled Line, Old title: Rendezvous Search on Finite Domains, Preprint, Department of Mathematical Sciences, Carnegie Mellon University (2001)Google Scholar
- 14.Flocchini, P., Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: The Rendezvous Search Problem with More Than Two Mobile Agents. Preprint (2002)Google Scholar
- 18.Pikounis, M., Thomas, L.C.: Many Player Rendezvous Search: Stick Together or Split and Meet? Working Paper 98/7, University of Edinburgh, Management School (1998)Google Scholar
- 19.Sawchuk, C.: Mobile Agent Rendezvous in the Ring. PhD Thesis, Carleton University (2004)Google Scholar