Abstract
We consider the rendezvous problem for two robots on an arbitrary connected graph with n vertices and all its edges of length one. Two robots are initially located on two different vertices of the graph and can traverse its edges with different but constant speeds. The robots do not know their own speed. During their movement they are allowed to meet on either vertices or edges of the graph. Depending on certain conditions reflecting the knowledge of the robots we show that a rendezvous algorithm is always possible on a general connected graph.
More specifically, we give new rendezvous algorithms for two robots as follows. (1) In unknown topologies. We provide a polynomial time rendezvous algorithm based on universal exploration sequences, assuming that n is known to the robots. (2) In known topologies. In this case we prove the existence of more efficient rendezvous algorithms by considering the special case of the two-dimensional torus.
Keywords
- Graph
- Mobile agents
- Rendezvous
- Speeds
- Universal exploration sequence
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
In fact they are (deterministically) constructible in polylogarithmic space, but to date it is unknown whether a universal traversal (or exploration) sequence of length \(O(n^3d^2 \log n)\) can be constructed in polynomial time.
- 2.
This algorithm builds on an idea proposed (without its analysis) by an unknown reviewer based on an algorithm appearing in an earlier version of this paper.
References
Aleliunas, R., Karp, R.M., Lipton, R.J., Lovasz, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: FOCS, pp. 218–223. IEEE (1979)
Alpern, S.: The rendezvous search problem. SIAM J. Control Optim. 33(3), 673–683 (1995)
Alpern, S.: Rendezvous search: a personal perspective. Oper. Res. 50(5), 772–795 (2002)
Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publishers, New York (2002). International Series in Operations Research and Management Science
Czyzowicz, J., Ilcinkas, D., Labourel, A., Pelc, A.: Asynchronous deterministic rendezvous in bounded terrains. TCS 412(50), 6926–6937 (2011)
Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: log-space rendezvous in arbitrary graphs. Distrib. Comput. 25(2), 165–178 (2012)
Czyzowicz, J., Kosowski, A., Pelc, A.: Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains. Theor. Comput. Syst. 52(2), 179–199 (2013)
Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. Theoret. Comput. Sci. 355(3), 315–326 (2006)
Dessmark, A., Fraigniaud, P., Kowalski, D., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica 46, 69–96 (2006)
Dieudonné, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2013, pp. 92–99 (2013)
Feinerman, O., Korman, A., Kutten, S., Rodeh, Y.: Fast rendezvous on a cycle by agents with different speeds. In: Chatterjee, M., Cao, J., Kothapalli, K., Rajsbaum, S. (eds.) ICDCN 2014. LNCS, vol. 8314, pp. 1–13. Springer, Heidelberg (2014). doi:10.1007/978-3-642-45249-9_1
Huus, E., Kranakis, E.: Rendezvous of many agents with different speeds in a cycle. In: Papavassiliou, S., Ruehrup, S. (eds.) ADHOC-NOW 2015. LNCS, vol. 9143, pp. 195–209. Springer, Heidelberg (2015). doi:10.1007/978-3-319-19662-6_14
Koucky, M.: Universal traversal sequences with backtracking. J. Comput. Syst. Sci. 65, 717–726 (2002)
Kranakis, E., Krizanc, D., MacQuarrie, F., Shende, S.: Randomized rendezvous on a ring for agents with different speeds. In: Proceedings of the 15th International Conference on Distributed Computing and Networking (ICDCN) (2015)
Kranakis, E., Krizanc, D., Markou, E.: The mobile agent rendezvous problem in the ring: an introduction. Synthesis Lectures on Distributed Computing Theory Series. Morgan and Claypool Publishers, San Rafael (2010)
Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59, 331–347 (2012)
Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 17 (2008)
Sawchuk, C.: Mobile Agent Rendezvous in the Ring. Ph.D. thesis, Carleton University (2004)
Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts, strongly universal exploration sequences. ACM Trans. Algorithms 10(3), 12 (2014)
Yu, X., Yung, M.: Agent rendezvous: a dynamic symmetry-breaking problem. In: Meyer, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 610–621. Springer, Heidelberg (1996). doi:10.1007/3-540-61440-0_163
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Kranakis, E., Krizanc, D., Markou, E., Pagourtzis, A., Ramírez, F. (2017). Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs. In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds) SOFSEM 2017: Theory and Practice of Computer Science. SOFSEM 2017. Lecture Notes in Computer Science(), vol 10139. Springer, Cham. https://doi.org/10.1007/978-3-319-51963-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-51963-0_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-51962-3
Online ISBN: 978-3-319-51963-0
eBook Packages: Computer ScienceComputer Science (R0)