Randomized pursuit-evasion in a polygonal environment

IEEE Transactions on Robotics

Volumn 21, Issue 5, 2005, Pages 875-884

  Isler, Volkan ^a   Kannan, Sampath ^b   Khanna, Sanjeev ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Dynamic noncooperative game theory; Path planning; Pursuit evasion games; Randomized algorithms

Indexed keywords

ALGORITHMS; GAME THEORY; MOTION PLANNING; PROBABILITY; RANDOM PROCESSES;

DYNAMIC NONCOOPERATIVE GAME THEORY; PURSUIT-EVASION GAMES; RANDOMIZED ALGORITHMS;

ROBOTICS;

EID: 27144454543     PISSN: 15523098     EISSN: None     Source Type: Journal    
DOI: 10.1109/TRO.2005.851373     Document Type: Article

References (22)

1. V. Isler, S. Kannan, and S. Khanna, "Locating and capturing an evader in a polygonal environment," in Proc. 6th Workshop Algorithmic Problems Robot., 2004, pp. 351-367.
2. J. Sgall, "Solution of David Gale's lion and man problem," Theoret. Comput. Sci., vol. 259, no. 1-2, pp. 663-670, 2001.
3. J. Hespanha, H. J. Kim, and S. Sastry, "Multiple-agent probabilistic pursuit-evasion games," in Proc. 38th Conf. Decision Contr., 1999, pp. 2432-2437.
4. R. Vidal, O. Shakernia, J. Kim, D. Shim, and S. Sastry, "Probabilistic pursuit-evasion games: Theory, implementation, and experimental evaluation," IEEE Trans. Robot. Autom., vol. 18, no. 5, pp. 662-669, Oct. 2002.
5. J. P. Hespanha, G. J. Pappas, and M. Prandini, "Greedy control for hybrid pursuit-evasion games," in Proc. Eur. Control Conf., Porto, Portugal, Sep. 2000, pp. 2621-2626.
6. A. Sarmiento, R. Murrieta-Cid, and S. Hutchinson, "An efficient strategy for rapidly finding an object in a polygonal world," in Proc. IEEE/RSJ Int. Conf. Intell. Robots Optim. Syst., 2003, pp. 1153-1158.
7. B. Tovar, S. M. LaValle, and R. Murrieta, "Optimal navigation and object finding without geometric maps or localization," in Proc. IEEE Int. Conf. Robot. Autom., 2003, pp. 464-470.
8. R. Isaacs, Differential Games. New York: Dover, 1965.
9. T. Basar and G. J. Olsder, Dynamic Noncooperative Game Theory. Philadelphia, PA: SIAM, 1998.
10. I. Suzuki and M. Yamashita, "Searching for a mobile intruder in a polygonal region," in SIAM J. Comput., vol. 21, 1992, pp. 863-888.
11. S.-M. Park, J.-H. Lee, and K.-Y. Chwa. Visibility-based pursuit evasion in a polygonal region by a searcher, presented at Int. Colloq. Automata, Lang. Program.. [Online]. Available: citeseer.nj.nec.com/ park01visibilitybased.html
12. L. J. Guibas, J.-C. Latombe, S. M. LaValle, D. Lin, and R. Motwani, "A visibility-based pursuit-evasion problem," Int. J. Computat. Geom. Applicat., vol. 9, no. 4/5, pp. 471-1999, 1999.
13. J.-H. Lee, S.-M. Park, and K.-Y. Chwa, "Searching a polygonal room with one door by a 1-searcher," Int. J. Computat. Geom. Applicat., vol. 10, no. 2, pp. 201-220, 2000.
14. S. M. LaValle, D. Lin, L. J. Guibas, J.-C. Latombe, and R. Motwani, "Finding an unpredictable target in a workspace with obstacles," in Proc. IEEE Int. Conf. Robot. Autom., 1997, pp. 737-742.
15. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
16. J. O'Rourke, Computational Geometry in C. Cambridge, U.K.: Cambridge Univ. Press, 1998.
17. J. E. Littlewood, A Mathematician's Miscellany. London, U.K.: Methuen, 1953.
18. L. Alonso, A. S. Goldstein, and E. M. Reingold, ""Lion and man:" Upper and lower bounds," ORSA J. Comput., vol. 4, no. 4, pp. 447-452, 1992.
19. M. Keil, "Decomposing a polygon into simpler components," SIAM J. Comput., vol. 14, pp. 799-817, 1985.
20. B. Chazelle and D. Dobkin, "Optimal convex decompositions," in Computational Geometry, G. Toussaint, Ed. Amsterdam, The Netherlands: North-Holland, 1985, pp. 63-133.
21. R. Guy, "Unsolved problems in combinatorial games," in Proc. Symp. Appl. Math., 1991, pp. 183-189.
22. S. M. LaValle and J. Hinrichsen, "Visibility-based pursuit evasion: The case of curved environments," IEEE Trans. Robot. Autom., vol. 17, no. 2, pp. 196-201, Apr. 2001.