Hybrid control for visibility-based pursuit-evasion games

2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

Volumn 2, Issue , 2004, Pages 1432-1437

  Isler, Volkan ^a   Belta, Calin ^b   Daniilidis, K ^a   Pappas, G J ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b Drexel University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AIR TRAFFIC CONTROL; ALGORITHMS; COLLISION AVOIDANCE; ELECTRONIC GUIDANCE SYSTEMS; GAME THEORY; GRAPH THEORY; HAMILTONIANS; MATHEMATICAL MODELS; MOTION PLANNING; OPTIMAL CONTROL SYSTEMS; PARTIAL DIFFERENTIAL EQUATIONS; PROBABILITY; ROBOT APPLICATIONS;

EVADERS; MOTION CONSTRAINTS; POLYGONS; PURSUIT-EVASION GAMES;

ROBOTICS;

EID: 14044265719     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. M. Adler, H. Racke, N. Sivadasan, C. Sohler, and B. Vocking. Randomized pursuit-evasion in graphs. Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2002.
2. M. Aigner and M. Fromme. A game of cops and robbers. Discrete Applied Math, 8:1-12, 1984.
3. R. Alur, T. Henzinger, G. Lafferriere, and G. J. Pappas. Discrete abstractions of hybrid systems. Proceedings of the IEEE, 88(2):971-984, jul 2000.
4. T. Basar and G. J. Olsder. Dynamic Noncooperative Game Theory. SIAM, 1998.
5. C. Belta and L. Habets. Constructing decidable hybrid systems with velocity bounds. In 43rd IEEE Conference on Decision and Control, 2004. Submitted.
6. C. Belta, V. Isler, and G. J. Pappas. Discrete abstractions for robot motion planning and control in polygonal environments. Technical Report MS-CIS-04-13, University of Pennsylvania, 2004.
7. G. Brightwell and P. Winkler. Gibbs measures and dismantlable graphs. J. Comb. Theory (Series B), 78, 2000.
8. D. C. Conner, A. A. Rizzi, and H. Choset. Composition of local potential functions for global robot control and navigation. In Proceedings of the IEEE/RSJ Intl. Conference on Intelligent Robots and Systems, Las Vegas, Nevada, 2003.
9. L. J. Guibas, J.-C. Latombe, S. M. LaValle, D. Lin, and R. Motwani. A visibility-based pursuit-evasion problem. International Journal of Computational Geometry and Applications, 9(4/5):471-, 1999.
10. L. Habets and J. van Schuppen. A control problem for affine dynamical systems on a full-dimensional polytope. Automatica, 40:21-35, 2004.
11. R. Isaacs. Differential Games. Dover, 1965.
12. V. Isler, S. Kannan, and S. Khanna. Locating and capturing an evader in a polygonal environment. In Workshop on Algorithmic Foundations of Robotics (WAFR'04), 2004. to appear.
13. V. Isler, S. Kannan, and S. Khanna. Randomized pursuit-evasion with limited visibility. In Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1053-1063, 2004.
14. S. M. LaValle and J. Hinrichsen. Visibility-based pursuit-evasion: The case of curved environments. IEEE Transactions on Robotics and Automation, 17(2):196-201, Apr. 2001.
15. J.-H. Lee, S.-M. Park, and K.-Y. Chwa. Searching a polygonal room with one door by a 1-searcher. International Journal of Computational Geometry and Applications, 10(2):201-220, 2000.
16. J. Lewin. Differential Games. Springer Verlag, 1994.
17. N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H. Papadimitriou. The complexity of searching a graph. J. ACM, 1988.
18. R. Nowakawski and P. Winkler. Vertex-to-vertex pursuit in a graph. Discrete Math, 43:235-239, 1983.
19. J. O'Rourke. Computational Geometry in C. Cambridge University Press, 1998.
20. S.-M. Park, J.-H. Lee, and K.-Y. Chwa. Visibility-based pursuit-evasion in a polygonal region by a searcher. Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2076, 2001.
21. S. Rajko and S. M. LaValle. A pursuit-evasion bug algorithm. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 1954-1960, 2001.
22. J. Sgall. Solution of David Gale's lion and man problem. Theoret. Comput. Sci., 259(1-2):663-670, 2001.
23. I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM Journal on Computing, 21(5):863-888, 1992.
24. R. Vidal, O. Shakernia, J. Kim, D. Shim, and S. Sastry. Probabilistic pursuit-evasion games: Theory, implementation and experimental evaluation. IEEE Transactions on Robotics and Automation, 18:662-669, 2002.