Skip to main content
SpringerLink
Log in

Symmetric Rendezvous with Advice: How to Rendezvous in a Disk

  • Conference paper
  • First Online:
Structural Information and Communication Complexity (SIROCCO 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11085))

Abstract

In the classic Symmetric Rendezvous problem on a Line (SRL), two robots at known distance 2 but unknown direction execute the same randomized algorithm trying to minimize the expected rendezvous time. A long standing conjecture is that the best possible rendezvous time is 4.25 with known upper and lower bounds being very close to that value. We introduce and study a geometric variation of SRL that we call Symmetric Rendezvous in a Disk (SRD) where two robots at distance 2 have a common reference point at distance \(\rho \). We show that even when \(\rho \) is not too small, the two robots can meet in expected time that is less than 4.25. Part of our contribution is that we demonstrate how to adjust known, even simple and provably non-optimal, algorithms for SRL, effectively improving their performance in the presence of a reference point. Special to our algorithms for SRD is that, unlike in SRL, for every fixed \(\rho \) the worst case distance traveled, i.e. energy that is used, in our algorithms is finite. In particular, we show that the energy of our algorithms is \(O\left( \rho ^2\right) \), while we also explore time-energy tradeoffs, concluding that one may be efficient both with respect to time and energy, with only a minor compromise on the optimal termination time.

A full version of this work is posted on the Computing Research Repository [28]. K. Georgiou—Research supported in part by NSERC Discovery Grant. J. Griffiths—Research supported in part by NSERC Undergraduate Student Research Award. Y. Yakubov—Research supported in part by the FoS Undergraduate Research Program, Ryerson University.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alpern, S.: Hide and seek games. Seminar (1976)

    Google Scholar 

  2. Alpern, S.: The rendezvous search problem. SIAM J. Control Optim. 33(3), 673–711 (1995)

    Article  MathSciNet  Google Scholar 

  3. Alpern, S.: Rendezvous search: a personal perspective. Oper. Res. 50(5), 772–795 (2002)

    Article  MathSciNet  Google Scholar 

  4. Alpern, S.: Ten Open Problems in Rendezvous Search, pp. 223–230. Springer, New York (2013). https://doi.org/10.1007/978-1-4614-6825-7_14

    Book  MATH  Google Scholar 

  5. Alpern, S., Baston, V.: Rendezvous on a planar lattice. Oper. Res. 53(6), 996–1006 (2005)

    Article  MathSciNet  Google Scholar 

  6. Alpern, S., Baston, V.: A common notion of clockwise can help in planar rendezvous. Eur. J. Oper. Res. 175(2), 688–706 (2006)

    Article  MathSciNet  Google Scholar 

  7. Alpern, S., Baston, V.: Rendezvous in higher dimensions. SIAM J. Control Optim. 44(6), 2233–2252 (2006)

    Article  MathSciNet  Google Scholar 

  8. Alpern, S., Gal, S.: Rendezvous search on the line with distinguishable players. SIAM J. Control Optim. 33(4), 1270–1276 (1995)

    Article  MathSciNet  Google Scholar 

  9. Alpern, S., Gal, S.: The theory of search games and rendezvous. In: International Series in Operations Research & Management Science, vol. 55. Springer, Heidelberg (2003). https://doi.org/10.1007/b100809

  10. Steve Alpern and Wei Shi Lim: Rendezvous of three agents on the line. Naval Res. Logist. (NRL) 49(3), 244–255 (2002)

    Article  MathSciNet  Google Scholar 

  11. Anaya, J., Chalopin, J., Czyzowicz, J., Labourel, A., Pelc, A., Vaxès, Y.: Collecting information by power-aware mobile agents. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 46–60. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33651-5_4

    Chapter  Google Scholar 

  12. Anderson, E.J., Weber, R.R.: The rendezvous problem on discrete locations. J. Appl. Probab. 27(4), 839–851 (1990)

    Article  MathSciNet  Google Scholar 

  13. Anderson, E.J., Essegaier, S.: Rendezvous search on the line with indistinguishable players. SIAM J. Control Optim. 33(6), 1637–1642 (1995)

    Article  MathSciNet  Google Scholar 

  14. Barrière, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Rendezvous and election of mobile agents: impact of sense of direction. Theory Comput. Syst. 40(2), 143–162 (2007)

    Article  MathSciNet  Google Scholar 

  15. Baston, V.J.: Two rendezvous search problems on the line. Naval Res. Logist. 46, 335–340 (1999)

    Article  MathSciNet  Google Scholar 

  16. Baston, V., Gal, S.: Rendezvous on the line when the players’ initial distance is given by an unknown probability distribution. SIAM J. Control Optim. 36(6), 1880–1889 (1998)

    Article  MathSciNet  Google Scholar 

  17. Beveridge, A., Ozsoyeller, D., Isler, V.: Symmetric rendezvous on the line with an unknown initial distance. Technical report (2011)

    Google Scholar 

  18. Chester, E.J., Tütüncü, R.H.: Rendezvous search on the labeled line. Oper. Res. 52(2), 330–334 (2004)

    Article  MathSciNet  Google Scholar 

  19. Collins, A., Czyzowicz, J., Gąsieniec, L., Kosowski, A., Martin, R.: Synchronous rendezvous for location-aware agents. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 447–459. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24100-0_42

    Chapter  Google Scholar 

  20. Cooper, C., Frieze, A., Radzik, T.: Multiple random walks and interacting particle systems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 399–410. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02930-1_33

    Chapter  MATH  Google Scholar 

  21. Czyzowicz, J., Dobrev, S., Kranakis, E., Krizanc, D.: The power of tokens: rendezvous and symmetry detection for two mobile agents in a ring. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 234–246. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-77566-9_20

    Chapter  MATH  Google Scholar 

  22. Czyzowicz, J., Pelc, A., Labourel, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8(4), 37:1–37:14 (2012)

    Article  MathSciNet  Google Scholar 

  23. Das, S.: Distributed computing with mobile agents: solving rendezvous and related problems. Ph.D. thesis, University of Ottawa, Canada (2007)

    Google Scholar 

  24. Das, S.: Mobile agent rendezvous in a ring using faulty tokens. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds.) ICDCN 2008. LNCS, vol. 4904, pp. 292–297. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-77444-0_29

    Chapter  Google Scholar 

  25. Das, S., Luccio, F.L., Markou, E.: Mobile agents rendezvous in spite of a malicious agent. In: Bose, P., Gąsieniec, L.A., Römer, K., Wattenhofer, R. (eds.) ALGOSENSORS 2015. LNCS, vol. 9536, pp. 211–224. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-28472-9_16

    Chapter  Google Scholar 

  26. 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). https://doi.org/10.1007/978-3-642-45249-9_1

    Chapter  Google Scholar 

  27. 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). https://doi.org/10.1007/978-3-540-24698-5_62

    Chapter  Google Scholar 

  28. Georgiou, K., Griffiths, J., Yakubov, Y.: Symmetric rendezvous with advice: How to rendezvous in a disk. CoRR, abs/1805.03351 (2018)

    Google Scholar 

  29. Han, Q., Donglei, D., Vera, J., Zuluaga, L.F.: Improved bounds for the symmetric rendezvous value on the line. Oper. Res. 56(3), 772–782 (2008)

    Article  MathSciNet  Google Scholar 

  30. 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). https://doi.org/10.1007/11682462_60

    Chapter  Google Scholar 

  31. Kranakis, E., Krizanc, D., Markou, E.: The Mobile Agent Rendezvous Problem in the Ring. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafael (2010)

    Article  Google Scholar 

  32. Kranakis, E., Santoro, N., Sawchuk, C., Krizanc, D.: Mobile agent rendezvous in a ring. In: Distributed Computing Systems, pp. 592–599. IEEE (2003)

    Google Scholar 

  33. Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59(3), 331–347 (2012)

    Article  MathSciNet  Google Scholar 

  34. Prencipe, G.: Impossibility of gathering by a set of autonomous mobile robots. Theor. Comput. Sci 384(2–3), 222–231 (2007)

    Article  MathSciNet  Google Scholar 

  35. Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences. ACM Trans. Algorithms 10(3), 12:1–12:15 (2014)

    Article  MathSciNet  Google Scholar 

  36. Patchrawat Patch Uthaisombut: Symmetric rendezvous search on the line using move patterns with different lengths. Working paper (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Ryerson University, 350 Victoria St., Toronto, ON, M5B 2K3, Canada

    Konstantinos Georgiou, Jay Griffiths & Yuval Yakubov

Authors
  1. Konstantinos Georgiou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jay Griffiths
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuval Yakubov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Konstantinos Georgiou .

Editor information

Editors and Affiliations

  1. Ben-Gurion University of the Negev, Beer-Sheva, Israel

    Zvi Lotker

  2. Tel Aviv University, Tel Aviv, Israel

    Boaz Patt-Shamir

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Georgiou, K., Griffiths, J., Yakubov, Y. (2018). Symmetric Rendezvous with Advice: How to Rendezvous in a Disk. In: Lotker, Z., Patt-Shamir, B. (eds) Structural Information and Communication Complexity. SIROCCO 2018. Lecture Notes in Computer Science(), vol 11085. Springer, Cham. https://doi.org/10.1007/978-3-030-01325-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-01325-7_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-01324-0

  • Online ISBN: 978-3-030-01325-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation