Clearing a polygon with two 1-searchers

International Journal of Computational Geometry and Applications

Volumn 19, Issue 1, 2009, Pages 59-92

  Simov, Borislav H ^a   Slutzki, Giora ^b   Lavalle, Steven M ^c  

^a HEWLETT PACKARD COMPANY   (United States)

^b Iowa State University   (United States)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

Motion planning; Pursuit evasion; Robotics; Sensing; Visibility

Indexed keywords

EID: 65249099014     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195909002836     Document Type: Article

References (22)

1. S. M. LaValle and J. E. Hinrichsen, Visibility-based pursuit-evasion: the case of curved environments, IEEE Trans. Robot. Autom. 17(2) (2001) 196-202.
2. I. Suzuki and M. Yamashita, Searching for a mobile intruder in a polygonal region, SIAM J. Computing 21(5) (1992) 863-888.
3. C. Icking and R. Klein, The two guards problem, Int. J. Comput. Geom. Appl. 2(3) (1992) 257-285.
4. P. J. Heffernan, An optimal algorithm for the two-guard problem, Int. J. Comput. Geom. Appl. 6(1) (1996) 15-44.
5. L. H. Tseng, P. J. Heffernan and D. T. Lee, Two-guard walkability of simple polygons, Int. J. Comput. Geom. Appl. 8(1) (1998) 85-116.
6. D. Crass, I. Suzuki and M. Yamashita, Searching for a mobile intruder in a corridor - the open edge variant of the polygon search problem, Int. J. Comput. Geom. Appl. 5(4) (1995) 397-412.
7. J.-H. Lee, S.-M. Park and K.-Y. Chwa, Searching a polygonal room with a door by a 1-searcher, Int. J. Comput. Geom. Appl. 10(2) (2000) 201-220.
8. J.-H. Lee, S. Y. Shin and K.-Y. Chwa, Visibility-based pursuit-evasion in a polygonal room with a door, Proc. ACM Symp. Computational Geometry (SCG) (Miami Beach, FL, USA, June 1999), pp. 281-290.
9. B. H. Simov, G. Slutzki and S. M. LaValle, Pursuit-evasion using beam detection, Proc. IEEE Int. Conf. Robotics and Automation (ICRA) (San Francisco, CA, USA, April 2000), pp. 1657-1662.
10. S. M. LaValle, B. H. Simov and G. Slutzki, An algorithm for searching a polygonal region with a flashlight, Proc. ACM Symp. on Computational Geometry (SCG) (Hong-Kong, June 2000), pp. 260-269.
11. S.-M. Park, J.-H. Lee and K.-Y. Chwa, Visibility-based pursuit-evasion in a polygonal region by a searcher, eds. F. Orejas, P. G. Spirakis and J. Leeuwen, Proc. 28th ICALP, Lecture Notes in Computer Science, Vol. 2076 (Springer-Verlag, Berlin, 2001), pp. 456-468.
12. L. J. Guibas, J.-C. Latombe, S. M. LaValle, D. Lin and R. Motwani, Visibility-based pursuit-evasion in a polygonal environment, eds. F. Dehne, A. Rau-Chaplin, J.-R. Sack and R. Tamassia, WADS '97 Algorithms and Data Structures, Lecture Notes in Computer Science, Vol. 1272 (Springer-Verlag, Berlin, 1997), pp. 17-30.
13. A. Efrat, L. J. Guibas, S. Har-Peled, D. C. Lin, J. S. B. Mitchell and T. M. Murali, Sweeping simple polygons with a chain of guards, Proc. ACM-SIAM Symp. Discrete Algorithms (SODA) (San Francisco, CA, USA, 2000), pp. 927-936.
14. I. Suzuki, Y. Tazoe, M. Yamashita and T. Kameda, Searching a polygonal region from the boundary, Int. J. Comput. Geom. Appl. 11(5) (2001) 529-553.
15. I. Suzuki, M. Yamashita, H. Umemoto and T. Kameda, Bushiness and a tight worst-case upper bound on the search number of a simple polygon, Inform. Process. Lett. 66(1) (1998) 49-52.
16. 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) (2001) 208-236.
17. R. Vidal, O. Shakernia, H. Jin Kim, D. Hyunchul Shim and S. Sastry, Probabilistic pursuit-evasion games: Theory, implementation and experimental evaluation, IEEE Trans. Robot. Autom. 18(5) (2002) 662-669.
18. S. M. LaValle, B. H. Simov and G. Slutzki, An algorithm for searching a polygonal region with a flashlight, Int. J. Comput. Geom. Appl. 12(1 & 2) (2002) 87-113.
19. H. A. ElGindy and D. Avis, A linear algorithm for computing the visibility polygon from a point, J. Algorithms 2(2) (1981) 186-197.
20. B. Chazelle, Triangulating a simple polygon in linear time, Discr. Comput. Geom. 6(5) (1991) 485-524.
21. L. Guibas, J. Hershberger, D. Leven, M. Sharir and R. E. Tarjan, Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica 2(1) (1987) 209-233.
22. S. Sachs, S. M. LaValle and S. Rajko, Visibility-based pursuit-evasion in an unknown planar environment, Int. J. Robot. Res. 23(1) (2004) 3-26.