[1] T. Alam, M. M. Rahman, P. Carrillo, L. Bobadilla, and B. Rapp, Stochastic multi-robot patrolling with limited visibility, Journal of Intelligent & Robotic Systems, 97 (2020), pp. 411–429.
[2] A. Bagheri, A. Br¨otzner, F. Farivar, R. Ghasemi, F. Keshavarz-Kohjerdi, E. Krohn, B. J. Nilsson, and C. Schmidt, Minsum m watchmen’s routes in Stiegl polygons, in XX Spanish Meeting on Computational Geometry: Book of Abstracts, vol. 20, Universidad de Santiago de Compostela, 2023, pp. 41– 44.
[3] S. Bereg, J. D´ıaz-B´a˜nez, M. Haghpanah, P. Horn, M. Lopez, N. Mar´ın, A. Ram´ırez-Vigueras, F. Rodr´ıguez, O. Sol´e-Pi, A. Stevens, and J. Urrutia, Optimal placement of base stations in border surveillance using limited capacity drones, Theoretical Computer Science, 928 (2022), pp. 183–196.
[4] M. d. Berg, O. Cheong, M. v. Kreveld, and M. Overmars, Computational Geometry: Algorithms and Applications, Springer-Verlag TELOS, Santa Clara, CA, USA, 3rd ed. ed., 2008.
[5] W.-P. Chin and S. Ntafos, Shortest watchman routes in simple polygons, Discrete & Computational Ge- ometry, 6 (1991), pp. 9–31.
[6] J. David and T. R¨ognvaldsson, Multi-robot routing problem with min–max objective, Robotics, 10 (2021).
[7] M. Davoodi, E. Delfaraz, S. Ghobadi, and M. Masoori, Multi-robot exploration on grids with a bounded time, Scientia Iranica, 28 (2021), pp. 1515–1528.
[8] M. Dror, A. Efrat, A. Lubiw, and J. S. B. Mitchell, Touring a sequence of polygons, in Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC ’03, New York, NY, USA, 2003, Association for Computing Machinery, pp. 473–482.
[9] A. Dumitrescu and C. D. T´oth, Watchman tours for polygons with holes, Computational Geometry, 45 (2012), pp. 326–333.
[10] D. Dyer, J. Howell, and B. Pittman, The watchman’s walk problem on directed graphs, Australasian Journal of Combinatorics, 80 (2021), pp. 197–216.
[11] H. El Gindy and D. Avis, A linear algorithm for computing the visibility polygon from a point, Journal of Algorithms, 2 (1981), pp. 186–197.
[12] S. Gul, E. Tiktinsky, S. Shamshanov, and R. Cohen, Online exploration outside a convex obstacle, Theoretical Computer Science, 929 (2022), pp. 157–163.
[13] M. Hammar and B. J. Nilsson, Concerning the time bounds of existing shortest watchman route algorithms, in Fundamentals of Computation Theory, B. S. Chlebus and L. Czaja, eds., Berlin, Heidelberg, 1997, Springer Berlin Heidelberg, pp. 210–221.
[14] H. Hoorfar and A. Bagheri, A linear-time algorithm for orthogonal watchman route problem with minimum bends, CoRR, abs/1708.01461 (2017).
[15] L. Huang, M. Zhou, K. Hao, and E. Hou, A survey of multi-robot regular and adversarial patrolling, IEEE/CAA Journal of Automatica Sinica, 6 (2019), pp. 894–903.
[16] F. Li and R. Klette, An approximate algorithm for solving the watchman route problem, in Robot Vision, G. Sommer and R. Klette, eds., vol. 4931 of Lecture Notes in Computer Science, Berlin, Heidelberg, 2008, Springer, pp. 189–206.
[17] Y. Livne, D. Atzmon, S. Skyler, E. Boyarski, A. Shapiro, and A. Felner, Optimally solving the multiple watchman route problem with heuristic search, in Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, AAMAS ’23, 2023, pp. 905–913.
[18] S. S. Mahdavi and M. Ghodsi, Clearing an orthogonal polygon to find the evaders, Theoretical Computer Science, 847 (2020), pp. 175–184.
[19] J. S. B. Mitchell, Approximating watchman routes, in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’13, USA, 2013, Society for Industrial and Applied Mathematics, pp. 844–855.
[20] A. Mostafanasab, M. B. Menhaj, M. Shamshirsaz, and R. Fesharakifard, A novel mobile robot path planning method based on neuro-fuzzy controller, AUT J. Math. Comput., 6 (2025), pp. 41–53.
[21] B. J. Nilsson and E. Packer, An approximation algorithm for the two-watchman route in a simple polygon, in EuroCG 2016, 2016.
[22] B. J. Nilsson and C. Schmidt, k-transmitter watchman routes, in WALCOM: Algorithms and Computation, C.-C. Lin, B. M. T. Lin, and G. Liotta, eds., Cham, 2023, Springer Nature Switzerland, pp. 202–213.
[23] B. J. Nilsson and S. Schuierer, Shortest m-watchmen routes for histograms: the minmax case, in Pro- ceedings ICCI ‘92: Fourth International Conference on Computing and Information, 1992, pp. 30–33.
[24] B. J. Nilsson and D. Wood, Optimum watchmen routes in spiral polygons, in Proceedings of the Second Canadian Conference in Computational Geometry, Ottawa, Ontario, 1990, pp. 269–272
[25] D. Noh, J. Choi, J. Choi, D. Byun, Y. Kim, H.-R. Kim, S. Baek, S. Lee, and H. Myung, Mass: Multi-agent scheduling system for intelligent surveillance, in 2022 19th International Conference on Ubiquitous Robots (UR), 2022, pp. 252–257.
[26] E. Packer, Computing multiple watchman routes, in Experimental Algorithms, C. C. McGeoch, ed., Berlin, Heidelberg, 2008, Springer Berlin Heidelberg, pp. 114–128.
[27] W. pang Chin and S. Ntafos, Optimum watchman routes, Information Processing Letters, 28 (1988), pp. 39–44.
[28] B. Sadeghi Bigham, S. Dolatikalan, and A. Khastan, Minimum landmarks for robot localization in orthogonal environments, Evolutionary Intelligence, 15 (2022), pp. 2235–2238.
[29] S. Seiref, T. Jaffey, M. Lopatin, and A. Felner, Solving the watchman route problem on a grid with heuristic search, in Proceedings of the Thirteenth International Symposium on Combinatorial Search, SOCS 2020, Online Conference [Vienna, Austria], 26-28 May 2020, D. Harabor and M. Vallati, eds., AAAI Press, 2020, pp. 139–140.
[30] S. Skyler, D. Atzmon, T. Yaffe, and A. Felner, Solving the watchman route problem with heuristic search, Journal of Artificial Intelligence Research, 75 (2022), pp. 747–793.
[31] X. Tan, A linear-time 2-approximation algorithm for the watchman route problem for simple polygons, Theo- retical Computer Science, 384 (2007), pp. 92–103.
[32] X. Tan, T. Hirata, and Y. Inagaki, An incremental algorithm for constructing shortest watchman routes, International Journal of Computational Geometry & Applications, 3 (1993), pp. 351–365.
[33] , Corrigendum to ”an incremental algorithm for constructing shortest watchman routes”, International Journal of Computational Geometry & Applications, 9 (1999), pp. 319–323.
[34] X. Tan and B. Jiang, An improved algorithm for computing a shortest watchman route for lines, Information Processing Letters, 131 (2018), pp. 51–54.
[35] X. Tan and Q. Wei, Improved exploration of unknown polygons, Theoretical Computer Science, 922 (2022), pp. 424–437.
