Meeting in a Polygon by Anonymous Oblivious Robots

Authors Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita

Thumbnail PDF


  • Filesize: 0.49 MB
  • 15 pages

Document Identifiers

Author Details

Giuseppe A. Di Luna
Paola Flocchini
Nicola Santoro
Giovanni Viglietta
Masafumi Yamashita

Cite AsGet BibTex

Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Masafumi Yamashita. Meeting in a Polygon by Anonymous Oblivious Robots. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 14:1-14:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


The Meeting problem for k>=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. 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.
  • Meeting problem
  • Oblivious robots
  • Polygon
  • Self-stabilization


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. S. Alpern and S. Gal. The theory of search games and rendezvous. Springer, 2003. Google Scholar
  2. H. Ando, Y. Oasa, I. Suzuki, and M. Yamashita. Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Transactions on Robotics and Automation, 15(5):818-828, 1999. Google Scholar
  3. L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and real computation. Springer-Verlag New York, 1998. Google Scholar
  4. J. Chalopin, S. Das, Y. Disser, M. Mihalák, and P. Widmayer. Mapping simple polygons: how robots benefit from looking back. Algorithmica, 65(1):43-59, 2013. Google Scholar
  5. J. Chalopin, S. Das, Y. Disser, M. Mihalák, and P. Widmayer. Simple agents learn to find their way: an introduction on mapping polygons. Discrete Applied Mathematics, 161(10-11):1287-1307, 2013. Google Scholar
  6. J. Chalopin, S. Das, Y. Disser, M. Mihalák, and P. Widmayer. Mapping simple polygons: the power of telling convex from reflex. ACM Transactions on Algorithms, 11(4):33:1-33:16, 2015. Google Scholar
  7. M. Cieliebak, P. Flocchini, G. Prencipe, and N. Santoro. Distributed computing by mobile robots: Gathering. SIAM Journal on Computing, 41(4):829-879, 2012. Google Scholar
  8. H. Cohen. A course in computational algebraic number theory. Springer, 1993. Google Scholar
  9. J. Czyzowicz, D. Ilcinkas, A. Labourel, and A. Pelc. Asynchronous deterministic rendezvous in bounded terrains. Theoretical Computer Science, 412(50):6926-6937, 2011. Google Scholar
  10. J. Czyzowicz, A. Kosowski, and A. Pelc. Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains. Theory of Computing Systems, 52(2):179-199, 2013. Google Scholar
  11. J. Czyzowicz, A. Labourel, and A. Pelc. How to meet asynchronously (almost) everywhere. ACM Transactions on Algorithms, 8(4):37:1-37:14, 2012. Google Scholar
  12. X. Défago, M. Gradinariu, S. Messika, and P. Raïpin-Parvédy. Fault-tolerant and self-stabilizing mobile robots gathering. In Proceedings of the 20th International Conference on Distributed Computing, (DISC), pages 46-60, 2006. Google Scholar
  13. Y. Dieudonné and A. Pelc. Deterministic polynomial approach in the plane. Distributed Computing, 28(2):111-129, 2015. Google Scholar
  14. Y. Dieudonné, A. Pelc, and V. Villain. How to meet asynchronously at polynomial cost. SIAM Journal on Computing, 44(3):844-867, 2015. Google Scholar
  15. Y. Dieudonné and F. Petit. Self-stabilizing gathering with strong multiplicity detection. Theoretical Computer Science, 428:47-57, 2012. Google Scholar
  16. P. Flocchini, G. Prencipe, and N. Santoro. Distributed computing by oblivious mobile robots. Morgan &Claypool, 2012. Google Scholar
  17. P. Flocchini, G. Prencipe, N. Santoro, and G. Viglietta. Distributed computing by mobile robots: Uniform Circle Formation. Distributed Computing, in press. Google Scholar
  18. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Gathering of asynchronous robots with limited visibility. Theoretical Computer Science, 337(1-3):147-168, 2005. Google Scholar
  19. P. Flocchini, N. Santoro, G. Viglietta, and M. Yamashita. Rendezvous with constant memory. Theoretical Computer Science, 621:57-72, 2016. Google Scholar
  20. G. A. Di Luna, P. Flocchini, S. Gan Chaudhuri, F. Poloni, N. Santoro, and G. Viglietta. Mutual visibility by luminous robots without collisions. Information and Computation, 254(3):392-418, 2017. Google Scholar
  21. L. Pagli, G. Prencipe, and G. Viglietta. Getting close without touching: Near-Gathering for autonomous mobile robots. Distributed Computing, 28(5):333-349, 2015. Google Scholar
  22. W. Rabinovich, J. Murphy, M. Suite, M. Ferraro, R. Mahon, P. Goetz, K. Hacker, W. Freeman, E. Saint Georges, S. Uecke, and J. Sender. Free-space optical data link to a small robot using modulating retroreflectors. In Proceedings of SPIE 7464, Free-Space Laser Communications IX, volume 7464, 2009. Google Scholar
  23. I. Rekleitis, V. Lee-Shue, A. Peng New, and H. Choset. Limited communication, multi-robot team based coverage. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pages 3462-3468, 2004. Google Scholar
  24. G. Sharma, C. Busch, and S. Mukhopadhyay. Mutual visibility with an optimal number of colors. In Proceedings of the 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), pages 196-210, 2016. Google Scholar
  25. G. Sharma, R. Vaidyanathan, J. L. Trahan, C. Busch, and S. Rai. 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), pages 327-345, 2016. Google Scholar
  26. T. Shermer. Hiding people in polygons. Computing, 42(2):109-131, 1989. Google Scholar
  27. I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM Journal on Computing, 21(5):863-888, 1992. Google Scholar
  28. M. Yamashita, H. Umemoto, I. Suzuki, and T. Kameda. Searching for mobile intruders in a polygonal region by a group of mobile searchers. Algorithmica, 31(2):208-236, 2001. Google Scholar