Advertisement

Meeting in a polygon by anonymous oblivious robots

  • Giuseppe Antonio Di Luna
  • Paola Flocchini
  • Nicola Santoro
  • Giovanni VigliettaEmail author
  • Masafumi Yamashita
Article

Abstract

The Meeting problem for \(k\ge 2\) searchers in a polygon P (possibly with holes) consists in making the searchers move within P, according to a distributed algorithm, in such a way that at least two of them eventually come to see each other, regardless of their initial positions. The polygon is initially unknown to the searchers, and its edges obstruct both movement and vision. Depending on the shape of P, we minimize the number of searchers k for which the Meeting problem is solvable. Specifically, if P has a rotational symmetry of order \(\sigma \) (where \(\sigma =1\) corresponds to no rotational symmetry), we prove that \(k=\sigma +1\) searchers are sufficient, and the bound is tight. Furthermore, we give an improved algorithm that optimally solves the Meeting problem with \(k=2\) searchers in all polygons whose barycenter is not in a hole (which includes the polygons with no holes). Our algorithms can be implemented in a variety of standard models of mobile robots operating in Look–Compute–Move cycles. For instance, if the searchers have memory but are anonymous, asynchronous, and have no agreement on a coordinate system or a notion of clockwise direction, then our algorithms work even if the initial memory contents of the searchers are arbitrary and possibly misleading. Moreover, oblivious searchers can execute our algorithms as well, encoding information by carefully positioning themselves within the polygon. This code is computable with basic arithmetic operations (provided that the coordinates of the polygon’s vertices are algebraic real numbers in some global coordinate system), and each searcher can geometrically construct its own destination point at each cycle using only a compass and a straightedge. We stress that such memoryless searchers may be located anywhere in the polygon when the execution begins, and hence the information they initially encode is arbitrary. Our algorithms use a self-stabilizing map construction subroutine which is of independent interest.

Notes

Acknowledgements

The authors wish to thank Francesco Veneziano for a clarifying discussion. This research has been supported in part by the Natural Sciences and Engineering Research Council of Canada under the Discovery Grant program and by Prof. Flocchini’s University Research Chair.

References

  1. 1.
    Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Springer, Berlin (2003)zbMATHGoogle Scholar
  2. 2.
    Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. Robot. Autom. 15(5), 818–828 (1999)CrossRefGoogle Scholar
  3. 3.
    Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, New York (1998)CrossRefzbMATHGoogle Scholar
  4. 4.
    Bouchard, S., Bournat, M., Dieudonné, Y., Dubois, S., Petit, F.: Asynchronous approach in the plane: a deterministic polynomial algorithm. In: Proceedings of the 31st International Symposium on Distributed Computing (DISC), pp. 8:1–8:16 (2017)Google Scholar
  5. 5.
    Chalopin, J., Das, S., Disser, Y., Mihalák, M., Widmayer, P.: Mapping simple polygons: how robots benefit from looking back. Algorithmica 65(1), 43–59 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Chalopin, J., Das, S., Disser, Y., Mihalák, M., Widmayer, P.: Mapping simple polygons: the power of telling convex from reflex. ACM Trans. Algorithms 11(4), 33:1–33:16 (2015)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, H.: A Course in Computational Algebraic Number Theory. Springer, Berlin (1993)CrossRefzbMATHGoogle Scholar
  9. 9.
    Czyzowicz, J., Ilcinkas, D., Labourel, A., Pelc, A.: Asynchronous deterministic rendezvous in bounded terrains. Theor. Comput. Sci. 412(50), 6926–6937 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Czyzowicz, J., Kosowski, A., Pelc, A.: Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains. Theory Comput. Syst. 52(2), 179–199 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8(4), 37:1–37:14 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Défago, X., Gradinariu, M., Messika, S., Raïpin-Parvédy, P.: Fault-tolerant and self-stabilizing mobile robots gathering. In: Proceedings of the 20th International Symposium on Distributed Computing, (DISC), pp. 46–60 (2006)Google Scholar
  13. 13.
    Dieudonné, Y., Pelc, A.: Deterministic polynomial approach in the plane. Distrib. Comput. 28(2), 111–129 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Dieudonné, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. SIAM J. Comput. 44(3), 844–867 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Dieudonné, Y., Petit, F.: Self-stabilizing gathering with strong multiplicity detection. Theor. Comput. Sci. 428, 47–57 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Disser, Y., Mihalák, M., Widmayer, P.: Mapping polygons with agents that measure angles. In: Frazzoli, E., Lozano-Perez, T., Roy, N., Rus, D. (eds.) Algorithmic Foundations of Robotics X, pp. 415–425. Springer, Berlin (2013)CrossRefGoogle Scholar
  17. 17.
    Di Luna, G.A., Flocchini, P., Gan Chaudhuri, S., Poloni, F., Santoro, N., Viglietta, G.: Mutual visibility by luminous robots without collisions. Inf. Comput. 254(3), 392–418 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Di Luna, G.A., Flocchini, P., Santoro, N., Viglietta, G., Yamashita, M.: Meeting in a polygon by anonymous oblivious robots. In: Proceedings of the 31st International Symposium on Distributed Computing (DISC), pp. 14:1–14:15 (2017)Google Scholar
  19. 19.
    Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Morgan & Claypool, San Rafael (2012)CrossRefzbMATHGoogle Scholar
  20. 20.
    Flocchini, P., Prencipe, G., Santoro, N., Viglietta, G.: Distributed computing by mobile robots: uniform circle formation. Distrib. Comput. 30(6), 413–457 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    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
  22. 22.
    Flocchini, P., Santoro, N., Viglietta, G., Yamashita, M.: Rendezvous with constant memory. Theor. Comput. Sci. 621, 57–72 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Hungerbühler, N.: A short elementary proof of the Mohr–Mascheroni theorem. Am. Math. Mon. 101(8), 784–787 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Kazarinoff, N.D.: Ruler and the Round: Classic Problems in Geometric Constructions. Dover, New York (2003)Google Scholar
  25. 25.
    Kiselev, A.P.: Kiselev’s Geometry Book I. Planimetry. Sumizdat, El Cerrito (2006)Google Scholar
  26. 26.
    Klobučar, D.: On nonexistence of an integer regular polygon. Math. Commun. 3(1), 75–80 (1998)MathSciNetzbMATHGoogle Scholar
  27. 27.
    Lehmer, D.H.: A note on trigonometric algebraic numbers. Am. Math. Mon. 40(3), 165–166 (1933)CrossRefzbMATHGoogle Scholar
  28. 28.
    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
  29. 29.
    Rabinovich, W., Murphy, J., Suite, M., Ferraro, M., Mahon, R., Goetz, P., Hacker, K., Freeman, W., Saint Georges, E., Uecke, S., Sender, J.: Free-space optical data link to a small robot using modulating retroreflectors. In: Proceedings of SPIE 7464, Free-Space Laser Communications IX, 7464 (2009)Google Scholar
  30. 30.
    Rekleitis, I., Lee-Shue, V., Peng New, A., Choset, H.: Limited communication, multi-robot team based coverage. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pp. 3462–3468 (2004)Google Scholar
  31. 31.
    Sharma, G., Busch, C., Mukhopadhyay, S.: Mutual visibility with an optimal number of colors. In: Proceedings of the 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), pp. 196–210 (2016)Google Scholar
  32. 32.
    Sharma, G., Vaidyanathan, R., Trahan, J.L., Busch, C., Rai, S.: Complete visibility for robots with lights in O(1) time. In: Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pp. 327–345 (2016)Google Scholar
  33. 33.
    Shermer, T.: Hiding people in polygons. Computing 42(2), 109–131 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  34. 34.
    Suzuki, I., Yamashita, M.: Searching for a mobile intruder in a polygonal region. SIAM J. Comput. 21(5), 863–888 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  35. 35.
    Yamashita, M., Umemoto, H., Suzuki, I., Kameda, T.: Searching for mobile intruders in a polygonal region by a group of mobile searchers. Algorithmica 31(2), 208–236 (2001)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

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

Authors and Affiliations

  • Giuseppe Antonio Di Luna
    • 1
  • Paola Flocchini
    • 2
  • Nicola Santoro
    • 3
  • Giovanni Viglietta
    • 4
    Email author
  • Masafumi Yamashita
    • 5
  1. 1.LIS LaboratoryAix-Marseille UniversityMarseilleFrance
  2. 2.School of Electrical Engineering and Computer ScienceUniversity of OttawaOttawaCanada
  3. 3.School of Computer ScienceCarleton UniversityOttawaCanada
  4. 4.School of Information ScienceJAISTNomiJapan
  5. 5.Department of Computer Science and Communication EngineeringKyushu UniversityFukuokaJapan

Personalised recommendations