Distributed Computing

, Volume 32, Issue 4, pp 317–337 | Cite as

Asynchronous approach in the plane: a deterministic polynomial algorithm

  • Sébastien Bouchard
  • Marjorie Bournat
  • Yoann DieudonnéEmail author
  • Swan Dubois
  • Franck Petit


In this paper we study the task of approach of two mobile agents having the same limited range of vision and moving asynchronously in the plane. This task consists in getting them in finite time within each other’s range of vision. The agents execute the same deterministic algorithm and are assumed to have a compass showing the cardinal directions as well as a unit measure. On the other hand, they do not share any global coordinates system (like GPS), cannot communicate and have distinct labels. Each agent knows its label but does not know the label of the other agent or the initial position of the other agent relative to its own. The route of an agent is a sequence of segments that are subsequently traversed in order to achieve approach. For each agent, the computation of its route depends only on its algorithm and its label. An adversary chooses the initial positions of both agents in the plane and controls the way each of them moves along every segment of the routes, in particular by arbitrarily varying the speeds of the agents. Roughly speaking, the goal of the adversary is to prevent the agents from solving the task, or at least to ensure that the agents have covered as much distance as possible before seeing each other. A deterministic approach algorithm is a deterministic algorithm that always allows two agents with any distinct labels to solve the task of approach regardless of the choices and the behavior of the adversary. The cost of a complete execution of an approach algorithm is the length of both parts of route travelled by the agents until approach is completed. Let \(\Delta \) and l be the initial distance separating the agents and the length of (the binary representation of) the shortest label, respectively. Assuming that\(\Delta \)andlare unknown to both agents, does there exist a deterministic approach algorithm always working at a cost that is polynomial in\(\Delta \)andl? Actually the problem of approach in the plane reduces to the network problem of rendezvous in an infinite oriented grid, which consists in ensuring that both agents end up meeting at the same time at a node or on an edge of the grid. By designing such a rendezvous algorithm with appropriate properties, as we do in this paper, we provide a positive answer to the above question. Our result turns out to be an important step forward from a computational point of view, as the other algorithms allowing to solve the same problem either have an exponential cost in the initial separating distance and in the labels of the agents, or require each agent to know its starting position in a global system of coordinates, or only work under a much less powerful adversary.


Mobile agents Asynchronous rendezvous Plane Infinite grid Deterministic algorithm Polynomial cost 


  1. 1.
    Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J. Comput. 36(1), 56–82 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Alpern, S.: The theory of search games and rendezvous. In: International Series in Operations Research and Management Science. Kluwer Academic Publishers (2003)Google Scholar
  3. 3.
    Alpern, S.: Rendezvous search: a personal perspective. Oper. Res. 50(5), 772–795 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Bampas, E., Czyzowicz, J., Gasieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids. In: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13–15, 2010. Proceedings, pp. 297–311 (2010)Google Scholar
  5. 5.
    Bouchard, S., Dieudonné, Y., Ducourthial, B.: Byzantine gathering in networks. Distrib. Comput. 29(6), 435–457 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Chalopin, J., Dieudonné, Y., Labourel, A., Pelc, A.: Rendezvous in networks in spite of delay faults. Distrib. Comput. 29(3), 187–205 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: gathering. SIAM J. Comput. 41(4), 829–879 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Cohen, R., Peleg, D.: Convergence properties of the gravitational algorithm in asynchronous robot systems. SIAM J. Comput. 34(6), 1516–1528 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Cohen, R., Peleg, D.: Convergence of autonomous mobile robots with inaccurate sensors and movements. SIAM J. Comput. 38(1), 276–302 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Collins, A., Czyzowicz, J., Gasieniec, L., Labourel, A.: Tell me where I am so I can meet you sooner. In: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6–10, 2010, Proceedings, Part II, pp. 502–514 (2010)Google Scholar
  11. 11.
    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)CrossRefzbMATHGoogle Scholar
  12. 12.
    Czyzowicz, J., Pelc, A., Labourel, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8(4), 37 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    D’Angelo, G., Di Stefano, G., Navarra, A.: Gathering on rings under the look-compute-move model. Distrib. Comput. 27(4), 255–285 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Das, S., Dereniowski, D., Kosowski, A., Uznanski, P.: Rendezvous of distance-aware mobile agents in unknown graphs. In: Structural Information and Communication Complexity—21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23–25, 2014. Proceedings, pp. 295–310 (2014)Google Scholar
  15. 15.
    Das, S., Luccio, F.L., Markou, E.: Mobile agents rendezvous in spite of a malicious agent. In: Algorithms for Sensor Systems: 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, Patras, Greece, September 17–18, 2015, Revised Selected Papers, pp. 211–224 (2015)Google Scholar
  16. 16.
    De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. Theor. Comput. Sci. 355(3), 315–326 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Défago, X., Gradinariu, M., Messika, S., Parvédy, P.R.: Fault-tolerant and self-stabilizing mobile robots gathering. In: Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18–20, 2006, Proceedings, pp. 46–60 (2006)Google Scholar
  18. 18.
    Dessmark, A., Fraigniaud, P., Kowalski, D.R., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica 46(1), 69–96 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Dieudonné, Y., Pelc, A.: Deterministic polynomial approach in the plane. Distrib. Comput. 28(2), 111–129 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Dieudonné, Y., Pelc, A.: Anonymous meeting in networks. Algorithmica 74(2), 908–946 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Dieudonné, Y., Petit, F.: Self-stabilizing gathering with strong multiplicity detection. Theor. Comput. Sci. 428, 47–57 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Dieudonné, Y., Pelc, A., Peleg, D.: Gathering despite mischief. ACM Trans. Algorithms 11(1), 1 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Dieudonné, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. SIAM J. Comput. 44(3), 844–867 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. 337(1–3), 147–168 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Fraigniaud, P., Pelc, A.: Deterministic rendezvous in trees with little memory. In: Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22–24, 2008. Proceedings, pp. 242–256 (2008)Google Scholar
  26. 26.
    Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. ACM Trans. Algorithms 9(2), 17 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  27. 27.
    Izumi, T., Souissi, S., Katayama, Y., Inuzuka, N., Défago, X., Wada, K., Yamashita, M.: The gathering problem for two oblivious robots with unreliable compasses. SIAM J. Comput. 41(1), 26–46 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  28. 28.
    Kowalski, D.R., Malinowski, A.: How to meet in anonymous network. Theor. Comput. Sci. 399(1–2), 141–156 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  29. 29.
    Kranakis, E., Krizanc, D., Rajsbaum, S.: Mobile agent rendezvous: a survey. In: Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2–5, 2006, Proceedings, pp. 1–9 (2006)Google Scholar
  30. 30.
    Miller, A., Pelc, A.: Fast rendezvous with advice. In: Algorithms for Sensor Systems: 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2014, Wroclaw, Poland, September 12, 2014, Revised Selected Papers, pp. 75–87 (2014)Google Scholar
  31. 31.
    Miller, A., Pelc, A.: Time versus cost tradeoffs for deterministic rendezvous in networks. Distrib. Comput. 29(1), 51–64 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  32. 32.
    Pagli, L., Prencipe, G., Viglietta, G.: Getting close without touching: near-gathering for autonomous mobile robots. Distrib. Comput. 28(5), 333–349 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  33. 33.
    Schelling, T.: The Strategy of Conflict. Oxford University Press, Oxford (1960)zbMATHGoogle Scholar
  34. 34.
    Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28(4), 1347–1363 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  35. 35.
    Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences. ACM Trans. Algorithms 10(3), 12 (2014)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Sorbonne Université, CNRS, INRIA, LIP6ParisFrance
  2. 2.MIS LaboratoryUniversité de Picardie Jules VerneAmiensFrance

Personalised recommendations