DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results
Two or more mobile entities, called agents or robots, starting at distinct initial positions in some environment, have to meet. This task is known in the literature as rendezvous. Among many alternative assumptions that have been used to study the rendezvous problem, two most significantly influence the methodology appropriate for its solution. The first of these assumptions concerns the environment in which the mobile entities navigate: it can be either a terrain in the plane, or a network modeled as an undirected graph. In the case of networks, methods and results further depend on whether the agents have the ability to mark nodes in some way. The second assumption concerns the way in which the entities move: it can be either deterministic or randomized. In this paper we survey models and results concerning deterministic rendezvous in networks, where agents cannot mark nodes.
Keywordsmobile agent rendezvous deterministic network graph
Unable to display preview. Download preview PDF.
- 6.Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: Log-space rendezvous in arbitrary graphs. In: Proc. 29th Annual ACM Symposium on Principles of Distributed Computing (PODC 2010), pp. 450–459 (2010)Google Scholar
- 7.Czyzowicz, J., Kosowski, A., Pelc, A.: Time vs. space trade-offs for rendezvous in trees (submitted)Google Scholar
- 8.Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. In: Proc. 21st ACM-SIAM Symp. on Discrete Algorithms (SODA 2010), pp. 22–30 (2010)Google Scholar
- 13.Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. In: Proc. 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2010), pp. 224–232 (2010)Google Scholar
- 14.Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees, arXiv:1102.0467v1 [cs.DC]Google Scholar
- 19.Kranakis, E., Krizanc, D., Markou, E.: The mobile agent rendezvous problem in the ring. Morgan and Claypool Publishers (2010)Google Scholar
- 22.Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 599–608 (2007)Google Scholar