Mobile Agent Rendezvous: A Survey

  • Evangelos Kranakis
  • Danny Krizanc
  • Sergio Rajsbaum
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4056)


Recent results on the problem of mobile agent rendezvous on distributed networks are surveyed with an emphasis on outlining the various approaches taken by researchers in the theoretical computer science community.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alpern, S.: Hide and Seek Games, Seminar, Institut für Höhere Studien, Wien (July 1976)Google Scholar
  2. 2.
    Alpern, S.: The Rendezvous Search Problem. SIAM Journal of Control and Optimization 33, 673–683 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publishers, Norwell (2003)zbMATHGoogle Scholar
  4. 4.
    Barriere, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Election and Rendezvous of Anonymous Mobile Agents in Anonymous Networks with Sense of Direction. In: Proceedings of the 9th Sirocco, pp. 17–32 (2003)Google Scholar
  5. 5.
    Baston, V., Gal, S.: Rendezvous Search When Marks Are Left at the Starting Points. Naval Research Logistics 47(6), 722–731 (2001)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Blum, A., Raghavan, P., Schieber, B.: Navigating in Unfamiliar Geometric Terrain. SIAM Journal on Computing 26, 110–137 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Buhrman, H., Franklin, M., Garay, J., Hoepman, J., Tromp, J., Vitanyi, P.: Mutual Search. Journal of the ACM 46, 517–536 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 271–282. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Deng, X., Papadimitriou, C.H.: Exploring an Unknown Graph. Journal of Graph Theory 32, 265–297 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Dessmark, A., Fraigniaud, P., Pelc, A.: Deterministic Rendezvous in Graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 184–195. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  11. 11.
    Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree Exploration with Little Memory. Journal of Algorithms 51, 38–63 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Multiple Agents Rendezvous in a Ring in spite of a Black Hole. In: Papatriantafilou, M., Hunel, P. (eds.) OPODIS 2003. LNCS, vol. 3144, pp. 34–46. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  13. 13.
    Flocchini, P., Mans, B., Santoro, N.: Sense of direction: definition, properties and classes. Networks 32, 29–53 (1998)CrossRefMathSciNetGoogle Scholar
  14. 14.
    Flocchini, P., Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Multiple Mobile Agent Rendezvous in a Ring. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 599–608. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  15. 15.
    Flocchini, P., Kranakis, E., Krizanc, D., Luccio, F.L., Santoro, N., Sawchuk, C.: Mobile agents rendezvous when tokens fail. In: Kralovic, R., Sýkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 161–172. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  16. 16.
    Gąsieniec, L., Kranakis, E., Krizanc, D., Zhang, X.: Optimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 282–292. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  17. 17.
    Kowalski, D.R., Pelc, A.: Polynomial deterministic rendezvous in arbitrary graphs. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 644–656. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  18. 18.
    Kowalski, D.R., Malinowski, A.: How to meet in anonymous network. In: Flocchini, P., Gąsieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 44–58. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  19. 19.
    Kranakis, E., Krizanc, D.: Searching with Uncertainty. In: Proc. of 6th Sirocco (1999)Google Scholar
  20. 20.
    Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile Agent Rendezvous Search Problem in the Ring. In: Proc. International Conference on Distributed Computing Systems (ICDCS), pp. 592–599 (2003)Google Scholar
  21. 21.
    Kranakis, E., Krizanc, D., Markou, E.: Mobile Agent Rendezvous in a Synchronous Torus. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 653–664. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  22. 22.
    Megiddo, N., Hakimi, S., Garey, M., Johnson, D., Papadimitriou, C.: The Complexity of Searching a Graph. Journal of the ACM 35, 18–44 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    Morin, P.: Personal communicationGoogle Scholar
  24. 24.
    Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)zbMATHGoogle Scholar
  25. 25.
    Panaite, P., Pelc, A.: Exploring Unknown Undirected Graphs. Journal of Algorithms 33, 281–295 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  26. 26.
    Roy, N., Dudek, G.: Collaborative robot exploration and rendezvous: Algorithms, performance bounds and observations. Autonomous Robots 11, 117–136 (2001)zbMATHCrossRefGoogle Scholar
  27. 27.
    Sawchuk, C.: Mobile Agent Rendezvous in the Ring, PhD thesis, Carleton University, School of Computer Science, Ottawa, Canada (2004)Google Scholar
  28. 28.
    Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: Formation of geometric patterns. SIAM Journal of Computing 28, 1347–1363 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  29. 29.
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Evangelos Kranakis
    • 1
  • Danny Krizanc
    • 2
  • Sergio Rajsbaum
    • 3
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada
  2. 2.Department of Mathematics and Computer ScienceWesleyan UniversityMiddletownUSA
  3. 3.Instituto de MatemáticasUniversidad Nacional Autónoma de México (UNAM)

Personalised recommendations