Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alpern, S.: Hide and Seek Games, Seminar, Institut für Höhere Studien, Wien (July 1976)
Alpern, S.: The Rendezvous Search Problem. SIAM Journal of Control and Optimization 33, 673–683 (1995)
Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publishers, Norwell (2003)
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)
Baston, V., Gal, S.: Rendezvous Search When Marks Are Left at the Starting Points. Naval Research Logistics 47(6), 722–731 (2001)
Blum, A., Raghavan, P., Schieber, B.: Navigating in Unfamiliar Geometric Terrain. SIAM Journal on Computing 26, 110–137 (1997)
Buhrman, H., Franklin, M., Garay, J., Hoepman, J., Tromp, J., Vitanyi, P.: Mutual Search. Journal of the ACM 46, 517–536 (1999)
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)
Deng, X., Papadimitriou, C.H.: Exploring an Unknown Graph. Journal of Graph Theory 32, 265–297 (1999)
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)
Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree Exploration with Little Memory. Journal of Algorithms 51, 38–63 (2004)
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)
Flocchini, P., Mans, B., Santoro, N.: Sense of direction: definition, properties and classes. Networks 32, 29–53 (1998)
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)
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)
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)
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)
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)
Kranakis, E., Krizanc, D.: Searching with Uncertainty. In: Proc. of 6th Sirocco (1999)
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)
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)
Megiddo, N., Hakimi, S., Garey, M., Johnson, D., Papadimitriou, C.: The Complexity of Searching a Graph. Journal of the ACM 35, 18–44 (1988)
Morin, P.: Personal communication
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)
Panaite, P., Pelc, A.: Exploring Unknown Undirected Graphs. Journal of Algorithms 33, 281–295 (1999)
Roy, N., Dudek, G.: Collaborative robot exploration and rendezvous: Algorithms, performance bounds and observations. Autonomous Robots 11, 117–136 (2001)
Sawchuk, C.: Mobile Agent Rendezvous in the Ring, PhD thesis, Carleton University, School of Computer Science, Ottawa, Canada (2004)
Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: Formation of geometric patterns. SIAM Journal of Computing 28, 1347–1363 (1999)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kranakis, E., Krizanc, D., Rajsbaum, S. (2006). Mobile Agent Rendezvous: A Survey. In: Flocchini, P., Gąsieniec, L. (eds) Structural Information and Communication Complexity. SIROCCO 2006. Lecture Notes in Computer Science, vol 4056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780823_1
Download citation
DOI: https://doi.org/10.1007/11780823_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35474-1
Online ISBN: 978-3-540-35475-8
eBook Packages: Computer ScienceComputer Science (R0)