Visibility-based pursuit-evasion in a polygonal environment

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1272, Issue , 1997, Pages 17-30

  Guibas, Leonidas J ^a   Latombe, Jean Claude ^a   LaValle, Steven M ^a   Lin, David ^a   Motwani, Rajeev ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

FINITE CELLS; FREE SPACES; MOTION STRATEGY; MOVING TARGETS; POLYGONAL ENVIRONMENT; ROBOTICS APPLICATIONS; VISIBILITY BASED PURSUIT EVASIONS;

SECURITY SYSTEMS;

EID: 84947924676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63307-3_45     Document Type: Conference Paper

References (23)

1. T. Başar and G. J, Olsder. Dynamic Noncooperative Game Theory. Academic Press, London, 1982.
2. D. Bienstock and P. Seymour. Monotonicity in graph searching. J. Algorithms, 12:239-245, 1991.
3. B. Chazelle. A theorem on polygon cutting with applications. In Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci., pages 339-349, 1982.
4. W.-P. Chin and S. Ntafos. Optimum watchman routes. Information Processing Letters, 28:39-44, 1988.
5. 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):397-412, 1995.
6. M. Erdmann. Randomization for robot tasks: Using dynamic programming in the space of knowledge states. Algorithmica, 10:248-291, 1993.
7. L. Guibas and J. Stolfe. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. AMC Trans. Graphics, 4(2):74-123, 1985.
8. L. J. Guibas, R. Motwani, and P. Raghavan. The robot localization problem. In K. Goldberg, D. Halperin, J.-C. Latombe, and R. Wilson, editors, Proc. 1st Workshop on Algorithmic Foundations of Robotics, pages 269-282. A.K. Peters, Wellesley, MA, 1995.
9. O. Hájek. Pursuit Games. Academic Press, New York, 1975.
10. R. Isaacs. Differential Games. Wiley, New York, NY, 1965.
11. A. S. Lapaugh. Recontamination does not help to search a graph. J. ACM, 40(2):224-245, April 1993.
12. S. M. LaVaJle. A Game-Theoretic Framework for Robot Motion Planning. PhD thesis, University of Illinois, Urbana, IL, July 1995.
13. S. M. LaValle, D. Lin, L. J. Guibas, J.-C. Latombe, and R. Motwani. Finding an unpredictable target in a workspace with obstacles. In Prof. IEEE Int’l Conf. on Robotics and Automation, 1997.
14. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM Journal of Applied Mathematics, 36:177-189, 1979.
15. F. Makedon and I. H. Sudborough. Minimizing width in linear layouts. In Proc. 10th ICALP, Lecture Notes in Computer Science 154, pages 478-490. Springer-Verlag, 1983.
16. N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H. Papadimitriou. The complexity of searching a graph. J. ACM, 35(1):18-44, January 1988.
17. B. Monien and I. H. Sudborough. Min cut is NP-complete for edge weighted graphs. Theoretical Computer Science, 58:209-229, 1988.
18. J. O’Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, New York, NY, 1987.
19. T. D. Parsons. Pursuit-evasion in a graph. In Y. Alani and D. R. Lick, editors, Theory and Applcation of Graphs, pages 426-441. Springer-Verlag, Berlin, 1976.
20. J. T. Schwartz and M. Sharir. On the piano movers’ problem: III. Coordinating the motion of several independent bodies. Int. J. Robot. Res., 2(3):97-140, 1983.
21. T. Shermer. Recent results in art galleries. Proc. IEEE, 80(9): 1384-1399, September 1992.
22. I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM J. Comput., 21(5):863-888, October 1992.
23. R. Talluri and J. K. Aggarwal. Mobile robot self-location using model-image feature correspondence. IEEE Trans. Robot. & Autom., 12(1):63-77, February 1996.