Visibility-based pursuit-evasion with limited field of View

International Journal of Robotics Research

Volumn 25, Issue 4, 2006, Pages 299-315

  Gerkey, Brian P ^a   Thrun, Sebastian ^b   Gordon, Geoff ^c  

^a SRI INTERNATIONAL   (United States)

^b STANFORD UNIVERSITY   (United States)

^c Carnegie Mellon University   (United States)

Author keywords

Computational geometry; Exact cell decomposition path planning; Pursuit evasion

Indexed keywords

COMPUTED TRAJECTORIES; EXACT CELL DECOMPOSITION PATH-PLANNING; PURSUIT-EVASION;

ALGORITHMS; COMPUTATIONAL GEOMETRY; MOBILE ROBOTS; PROBLEM SOLVING; SECURITY SYSTEMS;

VISIBILITY;

EID: 33645659455     PISSN: 02783649     EISSN: 17413176     Source Type: Journal    
DOI: 10.1177/0278364906065023     Document Type: Article

References (32)

1. Adler, M., Räcke, H., Sivadasan, N., Sohler, C. and Vcking, B. (2003). Randomized Pursuit-Evasion in Graphs. Combinatorics, Probability and Computing 12 (3). 225 - 244.
2. Avnaim, F., Boissonat, J. D. and Faverjon, B. (1988). Apractical exact planning algorithm for polygonal objects amidst polygonal obstacles. In Proc. of the IEEE Intl. Conf. on Robotics and Automation (ICRA), pp. 1656 - 1660.
3. Burgard, W., Fox, D., Moors, M., Simmons, R. and Thrun, S. (2000). Collaborative multi-robot exploration. In Proc. of the IEEE Intl. Conf. on Robotics and Automation (ICRA), San Francisco, California, pp. 476 - 481.
4. Burnikel, C., Fleischer, R., Mehlhorn, K. and Schirra, S. (1999). Efficient exact geometric computation made easy. In Proc. of the ACM Symp. on Computational Geometry, Miami Beach, Florida, pp. 341 - 350.
5. Gerkey, B. P., Thrun, S. and Gordon, G. (2005). Parallel stochastic hill-climbing with small teams. In L. E. Parker et al., eds, Multi-Robot Systems: From Swarms to Intelligent Automata, Volume III, Springer, The Netherlands, pp. 65 - 77.
6. Guibas, L. J., Latombe, J.-C., LaValle, S. M., Lin, D. and Motwani, R. (1999). A Visibility-Based Pursuit-Evasion Problem. Intl. J. of Computational Geometry and Applications 9 (4-5). 471 - 493.
7. Guibas, L. J., Motwani, R. and Raghavan, P. (1995). The robot localization problem. In K. Goldberg, J.-C. Latombe, R. Wilson and D. Halperin, eds, Algorithmic Foundations of Robotics. A.K. Peters, Natick, Massachusetts, pp. 269 - 282.
8. Hájek, O. (1975). Pursuit Games, Academic Press, New York.
9. Isaacs, R. (1965). Differential Games: A Mathematical Theory with Applications to Warfare and Pursuit, Control and Optimization, John Wiley & Sons, New York.
10. Isler, V., Kannan, S. and Khanna, S. (2005). Randomized pursuit-evasion in a polygonal environment. IEEE Transactions on Robotics 21 (5). 875 - 884.
11. Jung, B. and Sukhatme, G. S. (2002). Tracking Targets using Multiple Robots: The Effect of Environment Occlusion. Autonomous Robots 13 (3). 191 - 205.
12. Kalra, N., Ferguson, D. and Stentz, A. (2005). Hoplites: A market-based framework for planned tight coordination in multirobot teams. In Proc. of the IEEE Intl. Conf. on Robotics and Automation (ICRA), Barcelona, Spain, pp. 1170 - 1177.
13. Koenig, S. and Simmons, R. G. (1993). Exploration with and without a map. In Proceedings of the AAAI Workshop on Learning Action Models at the Eleventh National Conference on Artificial Intelligence (AAAI), pp. 28 - 32. (Also available as AAAI Technical Report WS-93-06.)
14. Latombe, J.-C. (1991). Robot Motion Planning, Kluwer Academic Publishers, Norwell, Massachusetts.
15. LaValle, S. M., Lin, D., Guibas, L. J., Latombe, J.-C. and Motwani, R. (1997). Finding an Unpredictable Target in a Workspace with Obstacles. In Proc. of the IEEE Intl. Conf. on Robotics and Automation (ICRA), Albuquerque, New Mexico, pp. 737 - 742.
16. Lee, J.-H., Park, S.-M. and Chwa, K.-Y. (2002). Simple algorithms for searching a polygon with flashlights, Information Processing Letters 81: 265 - 270.
17. Leven, D. and Sharir, M. (1987). An efficient and simple motion planning algorithm for a ladder moving in a 2-dimensional space amidst polygonal barriers. J. of Algorithms 8: 192 - 215.
18. Megiddo, N., Hakimi, S., Garey, M., Johnson, D. and Papadimitriou, C. (1988). The Complexity of Searching a Graph. J. of the ACM 35 (1). 18 - 44.
19. Monien, B. and Sudborough, I. (1988). Min cut is NPcomplete for edge weighted trees. Theoretical Computer Science 58: 209 - 229.
20. O'Rourke, J. (1987). Art Gallery Theorems and Algorithms, Oxford University Press, New York.
21. Park, S.-M., Lee, J.-H. and Chwa, K.-Y. (2001). Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher. In F. Orejas and P. G. Spirakis and J. van Leeuwen, eds, Automata, languages and programming, Lecture Notes in Computer Science 2076, Springer-Verlag, Berlin, pp. 456 - 468.
22. Parker, L. E. (1999). Cooperative Robotics for Multi-Target Observation. Intelligent Automation and Soft Computing 5 (1). 5 - 19.
23. Parsons, T. (1976). Pursuit-evasion in a graph. In Y. Alavi and D. Lick, eds, Theory and Applications of Graphs, Lecture Notes in Mathematics 642, Springer-Verlag, Berlin, pp. 426 - 441.
24. Roy, N. and Gordon, G. (2002). Exponential Family PCA for Belief Compression in POMDPs. In Proc. of Advances in Neural Information Processing Systems (NIPS), Vancouver, Canada.
25. Schwartz, J. and Sharir, M. (1983). On the 'piano movers' problem: I. The case of a rigid polygonal body moving amidst polygonal barriers. Communications on Pure and Applied Mathematics 36: 345 - 398.
26. Shermer, T. C. (1992). Recent results in art galleries. Proceedings of the IEEE 80 (9). 1384 - 1399.
27. Spletzer, J. R. and Taylor, C. J. (2003). Dynamic sensor planning and control for optimally tracking targets. The Intl. J. of Robotics Research 22 (1). 7 - 20.
28. Stroupe, A. (2003). Collaborative Execution of Exploration and Tracking Using Move Value Estimation for Robot Teams (MVERT), PhD thesis, Robotics Institute, Carnegie Mellon University, Pittsburgh, Pennsylvania.
29. Suzuki, I. and Yamashita, M. (1992). Searching for a mobile intruder in a polygonal region. SIAM J. on Computing 21 (5). 863 - 888.
30. Vidal, R., Shakernia, O., Kim, H. J., Shim, D. H. and Sastry, S. (2002). Probabalistic Pursuit-Evasion Games: Theory, Implementation, and Experimental Evaluation. IEEE Transactions on Robotics and Automation 18 (5). 662 - 669.
31. Werger, B. B. and Matarić, M. J. (2001). Broadcast of Local Eligibility for Multi-Target Observation. In L. E. Parker, G. Bekey and J. Barhen, eds, Distributed Autonomous Robotic Systems 4, Springer-Verlag, New York, pp. 347 - 356.
32. Yamauchi, B. (1998). Frontier-Based Exploration Using Multiple Robots. In Proc. of Autonomous Agents, Minneapolis, Minnesota, pp. 47 - 53.