Skip to main content
SpringerLink
Log in

Deterministic Rendezvous Algorithms

  • Chapter
  • First Online:
Distributed Computing by Mobile Entities

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

Abstract

The task of rendezvous (also called gathering) calls for a meeting of two or more mobile entities, starting from different positions in some environment. Those entities are called mobile agents or robots, and the environment can be a network modeled as a graph or a terrain in the plane, possibly with obstacles. The rendezvous problem has been studied in many different scenarios. Two among many adopted assumptions particularly influence the methodology to be used to accomplish rendezvous. One of the assumptions specifies whether the agents in their navigation can see something apart from parts of the environment itself, for example other agents or marks left by them. The other assumption concerns the way in which the entities move: it can be either deterministic or randomized. In this paper we survey results on deterministic rendezvous of agents that cannot see the other agents prior to meeting them, and cannot leave any marks.

A. Pelc—Research supported in part by NSERC Discovery Grant 8136 – 2013 and by the Research Chair in Distributed Computing of the Université du Québec en Outaouais.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.: Rendezvous search: a personal perspective. Oper. Res. 50, 772–795 (2002)

    Article  MathSciNet  Google Scholar 

  2. Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. International Series in Operations Research and Management Science. Kluwer Academic Publishers, Norwell (2003)

    MATH  Google Scholar 

  3. Baba, D., Izumi, T., Ooshita, F., Kakugawa, H., Masuzawa, T.: Linear time and space gathering of anonymous mobile agents in asynchronous trees. Theor. Comput. Sci. 478, 118–126 (2013)

    Article  MathSciNet  Google Scholar 

  4. Bampas, E., Czyzowicz, J., Gąsieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 297–311. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15763-9_28

    Chapter  Google Scholar 

  5. Bouchard, S., Dieudonné, Y., Ducourthial, B.: Byzantine gathering in networks. Distrib. Comput. 29, 435–457 (2016)

    Article  MathSciNet  Google Scholar 

  6. Bouchard, S., Bournat, M., Dieudonné, Y., Dubois, S., Petit, F.: Asynchronous approach in the plane: a deterministic polynomial algorithm. In: Proceedings of 31st International Symposium on Distributed Computing (DISC 2017), pp. 8:1–8:16 (2017)

    Google Scholar 

  7. Bouchard, S., Dieudonné, Y., Lamani, A.: Byzantine gathering in polynomial time. In: Proceedings of 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), pp. 147:1–147:15 (2018)

    Google Scholar 

  8. Bouchard, S., Dieudonné, Y., Pelc, A., Petit, F.: Deterministic rendezvous at a node of agents with arbitrary velocities. Inf. Process. Lett. 133, 39–43 (2018)

    Article  MathSciNet  Google Scholar 

  9. Chalopin, J., Dieudonné, Y., Labourel, A., Pelc, A.: Rendezvous in networks in spite of delay faults. Distrib. Comput. 29, 187–205 (2016)

    Article  MathSciNet  Google Scholar 

  10. Collins, A., Czyzowicz, J., Gąsieniec, L., Labourel, A.: Tell me where i am so i can meet you sooner. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 502–514. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14162-1_42

    Chapter  Google Scholar 

  11. Cornejo, A., Kuhn, F.: Deploying wireless networks with beeps. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 148–162. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15763-9_15

    Chapter  Google Scholar 

  12. Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: log-space rendezvous in arbitrary graphs. Distrib. Comput. 25, 165–178 (2012)

    Article  Google Scholar 

  13. Czyzowicz, J., Kosowski, A., Pelc, A.: Time vs. space trade-offs for rendezvous in trees. Distrib. Comput. 27, 95–109 (2014)

    Google Scholar 

  14. Czyzowicz, J., Kosowski, A., Pelc, A.: Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains. Theory Comput. Syst. 52, 179–199 (2013)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  16. Das, S., Dereniowski, D., Kosowski, A., Uznański, P.: Rendezvous of distance-aware mobile agents in unknown graphs. In: Halldórsson, M.M. (ed.) SIROCCO 2014. LNCS, vol. 8576, pp. 295–310. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-09620-9_23

    Chapter  Google Scholar 

  17. De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. Theoret. Comput. Sci. 355, 315–326 (2006)

    Article  MathSciNet  Google Scholar 

  18. Dessmark, A., Fraigniaud, P., Kowalski, D., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica 46, 69–96 (2006)

    Article  MathSciNet  Google Scholar 

  19. Dieudonné, Y., Pelc, A.: Anonymous meeting in networks. Algorithmica 74, 908–946 (2016)

    Article  MathSciNet  Google Scholar 

  20. Dieudonné, Y., Pelc, A.: Deterministic polynomial approach in the plane. Distrib. Comput. 28, 111–129 (2015)

    Article  MathSciNet  Google Scholar 

  21. Dieudonné, Y., Pelc, A.: Price of asynchrony in mobile agents computing. Theoret. Comput. Sci. 524, 59–67 (2014)

    Article  MathSciNet  Google Scholar 

  22. Dieudonné, Y., Pelc, A., Peleg, D.: Gathering despite mischief. ACM Trans. Algorithms 11, 1:1–1:28 (2014)

    Google Scholar 

  23. Dieudonné, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. SIAM J. Comput. 44, 844–867 (2015)

    Article  MathSciNet  Google Scholar 

  24. Elouasbi, S., Pelc, A.: Deterministic rendezvous with detection using beeps. Int. J. Found. Comput. Sci. 28, 77–97 (2017)

    Article  MathSciNet  Google Scholar 

  25. Elouasbi, S., Pelc, A.: Deterministic meeting of sniffing agents in the plane. Fundam. Informaticae 160, 281–301 (2018)

    Article  MathSciNet  Google Scholar 

  26. Elouasbi, S., Pelc, A.: Time of anonymous rendezvous in trees: determinism vs. randomization. In: Even, G., Halldórsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 291–302. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31104-8_25

    Chapter  Google Scholar 

  27. Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. ACM Trans. Algorithms 9, 17:1–17:24 (2013)

    Article  MathSciNet  Google Scholar 

  28. Guilbault, S., Pelc, A.: Asynchronous rendezvous of anonymous agents in arbitrary graphs. In: Fernàndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 421–434. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25873-2_29

    Chapter  Google Scholar 

  29. Kouckỳ, M.: Universal traversal sequences with backtracking. J. Comput. Syst. Sci. 65, 717–726 (2002)

    Article  MathSciNet  Google Scholar 

  30. Kowalski, D., Malinowski, A.: How to meet in anonymous network. Theoret. Comput. Sci. 399, 141–156 (2008)

    Article  MathSciNet  Google Scholar 

  31. Kranakis, E., Krizanc, D., Markou, E.: The Mobile Agent Rendezvous Problem in the Ring. Morgan and Claypool Publishers, San Rafael (2010)

    Article  Google Scholar 

  32. Kranakis, E., Krizanc, D., Rajsbaum, S.: Mobile agent rendezvous: a survey. In: Flocchini, P., Gąsieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 1–9. Springer, Heidelberg (2006). https://doi.org/10.1007/11780823_1

    Chapter  Google Scholar 

  33. Miller, A., Pelc, A.: Time versus cost tradeoffs for deterministic rendezvous in networks. Distrib. Comput. 29, 51–64 (2016)

    Article  MathSciNet  Google Scholar 

  34. Miller, A., Pelc, A.: Fast rendezvous with advice. Theoret. Comput. Sci. 608, 190–198 (2015)

    Article  MathSciNet  Google Scholar 

  35. Ooshita, F., Datta, A.K., Masuzawa, T.: Self-stabilizing rendezvous of synchronous mobile agents in graphs. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 18–32. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-69084-1_2

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  37. Pelc, A.: Deterministic gathering with crash faults, CoRR abs/1704.08880 (2017)

    Google Scholar 

  38. Reingold, O.: Undirected connectivity in log-space. J. ACM 55, 1–24 (2008)

    Article  MathSciNet  Google Scholar 

  39. Schelling, T.: The Strategy of Conflict. Oxford University Press, Oxford (1960)

    MATH  Google Scholar 

  40. Stachowiak, G.: Asynchronous deterministic rendezvous on the line. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 497–508. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-540-95891-8_45

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  42. Yamashita, M., Kameda, T.: Computing on anonymous networks: part i-characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7, 69–89 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d’informatique, Université du Québec en Outaouais, Gatineau, QC, J8X 3X7, Canada

    Andrzej Pelc

Authors
  1. Andrzej Pelc
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrzej Pelc .

Editor information

Editors and Affiliations

  1. University of Ottawa, Ottawa, ON, Canada

    Paola Flocchini

  2. University of Pisa, Pisa, Italy

    Giuseppe Prencipe

  3. Carleton University, Ottawa, ON, Canada

    Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Pelc, A. (2019). Deterministic Rendezvous Algorithms. In: Flocchini, P., Prencipe, G., Santoro, N. (eds) Distributed Computing by Mobile Entities. Lecture Notes in Computer Science(), vol 11340. Springer, Cham. https://doi.org/10.1007/978-3-030-11072-7_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-11072-7_17

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation