Abstract
Pursuit-evasion games have been used for modeling various forms of conflict arising between two agents modeled as dynamical systems. Although analytical solutions of some simple pursuit-evasion games are known, most interesting instances can only be solved using numerical methods requiring significant offline computation. In this paper, a novel incremental sampling-based algorithm is presented to compute optimal open-loop solutions for the evader, assuming worst-case behavior for the pursuer. It is shown that the algorithm has probabilistic completeness and soundness guarantees. As opposed to many other numerical methods tailored to solve pursuit-evasion games, incremental sampling-based algorithms offer anytime properties, which allow their real-time implementations in online settings.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Isaacs, R.: Differential Games. Wiley, Chichester (1965)
Basar, T., Olsder, G.J.: Dynamic Noncooperative Game Theory, 2nd edn. Academic Press, London (1995)
Mitchell, I.M., Bayen, A.M., Tomlin, C.J.: A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games. IEEE Transactions on Automatic Control 50(7), 947–957 (2005)
Lachner, R., Breitner, M.H., Pesch, H.J.: Three dimensional air combat: Numerical solution of complex differential games. In: Olsder, G.J. (ed.) New Trends in Dynamic Games and Applications, pp. 165–190. Birkhäuser, Basel (1995)
Vanek, O., Bosansky, B., Jakob, M., Pechoucek, M.: Transiting areas patrolled by a mobile adversary. In: Proc. IEEE Conf. on Computational Intelligence and Games (2010)
Simaan, M., Cruz, J.B.: On the Stackelberg strategy in nonzero-sum games. Journal of Optimization Theory and Applications 11(5), 533–555 (1973)
Bardi, M., Falcone, M., Soravia, P.: Numerical methods for pursuit-evasion games via viscosity solutions. In: Barti, M., Raghavan, T.E.S., Parthasarathy, T. (eds.) Stochastic and Differential Games: Theory and Numerical Methods. Birkhäuser, Basel (1999)
Ehtamo, H., Raivio, T.: On applied nonlinear and bilevel programming for pursuit-evasion games. Journal of Optimization Theory and Applications 108, 65–96 (2001)
Breitner, M.H., Pesch, H.J., Grimm, W.: Complex differential games of pursuit-evasion type with state constraints, part 1: Necessary conditions for optimal open-loop strategies. Journal of Optimization Theory and Applications 78, 419–441 (1993)
Breitner, M.H., Pesch, H.J., Grim, W.: Complex differential games of pursuit-evasion type with state constraints, part 2: Numerical computation of optimal open-loop strategies. Journal of Optimization Theory and Applications 78, 444–463 (1993)
Russell, R.D., Shampine, L.F.: A collocation method for boundary value problems. Numerische Mathematik 19(1), 1–28 (1972)
van Stryk, O., Bulirsch, R.: Direct and indirect methods for trajectory optimization. Annals of Operations Research 37, 357–373 (1992)
Sethian, J.A.: Level Set Methods and Fast Marching Methods: Evolving Surfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science. Cambridge University Press, Cambridge (1996)
Latombe, J.C.: Robot Motion Planning. Kluwer Academic Publishers, Boston (1991)
LaValle, S.: Planning Algorithms. Cambridge University Press, Cambridge (2006)
Petti, S., Fraichard, Th.: Safe motion planning in dynamic environments. In: Proc. Int. Conf. on Intelligent Robots and Systems (2005)
Hsu, D., Kindel, R., Latombe, J., Rock, S.: Randomized kinodynamic motion planning with moving obstacles. International Journal of Robotics Research 21(3), 233–255 (2002)
Reif, J., Sharir, M.: Motion planning in presence of moving obstacles. In: Proceedings of the 25th IEEE Symposium FOCS (1985)
Erdmann, M., Lozano-Perez, T.: On multiple moving objects. Algorithmica 2, 477–521 (1987)
Sutner, K., Maass, W.: Motion planning among time dependent obstacles. Acta Informatica 26, 93–122 (1988)
Fujimura, K., Samet, H.: Planning a time-minimal motion among moving obstacles. Algorithmica 10, 41–63 (1993)
Farber, M., Grant, M., Yuzvinski, S.: Topological complexity of collision free motion, planning algorithms in the presence of multiple moving obstacles. In: Farber, M., Ghrist, G., Burger, M., Koditschek, D. (eds.) Topology and Robotics, pp. 75–83. American Mathematical Society, Providence (2007)
Zucker, M., Kuffner, J., Branicky, M.: Multipartite RRTs for rapid replanning in dynamic environments. In: IEEE Conference on Robotics and Automation (ICRA) (2007)
van der Berg, J., Overmars, M.: Planning the shortest safe path amidst unpredictably moving obstacles. In: Workshop on Algorithmic Foundations of Robotics VII (2008)
Parsons, T.: Pursuit-evasion in a graph. In: Theory and Applications of Graphs, pp. 426–441 (1978)
Isler, V., Kannan, S., Khanna, S.: Randomized pursuit-evasion with limited visibility. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana, pp. 1060–1069. Society for Industrial and Applied Mathematics (2004)
Adler, M., Räcke, H., Sivadasan, N., Sohler, C., Vöocking, B.: Randomized pursuit-evasion in graphs. Combinatorics. Probability and Computing 12(03), 225–244 (2003)
Suzuki, I., Yamashita, M.: Searching for a mobile intruder in a polygonal region. SIAM Journal on computing 21, 863 (1992)
Gerkey, B., Thrun, S., Gordon, G.: Clear the building: Pursuit-evasion with teams of robots. In: Proceedings AAAI National Conference on Artificial Intelligence (2004)
Isler, V., Kannan, S., Khanna, S.: Locating and capturing an evader in a polygonal environment. Algorithmic Foundations of Robotics VI, 251–266 (2005)
Isler, V., Sun, D., Sastry, S.: Roadmap based pursuit-evasion and collision avoidance. In: Robotics: Science and Systems Conference (2005)
Kavraki, L.E., Svestka, P., Latombe, J., Overmars, M.H.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation 12(4), 566–580 (1996)
LaValle, S.M., Kuffner, J.J.: Randomized kinodynamic planning. International Journal of Robotics Research 20(5), 378–400 (2001)
Kuwata, Y., Teo, J., Fiore, G., Karaman, S., Frazzoli, E., How, J.P.: Real-time motion planning with applications to autonomous urban driving. IEEE Transactions on Control Systems 17(5), 1105–1118 (2009)
Karaman, S., Frazzoli, E.: Incremental sampling-based algorithms for optimal motion planning. In: Robotics: Science and Systems, RSS (2010)
Dean, T., Boddy, M.: Analysis of time-dependent planning. In: Proceedings of AAAI (1989)
Zilberstein, S., Russell, S.: Approximate Reasoning Using Anytime Algorithms. In: Imprecise and Approximate Computation, vol. 318, pp. 43–62. Springer, Heidelberg (1995)
Canny, J.: The Complexity of Robot Motion Planning. MIT Press, Cambridge (1988)
Karaman, S., Frazzoli, E.: Optimal kinodynamic motion planning using incremental sampling-based methods. In: IEEE Conf. on Decision and Control, Atlanta, GA (2010)
Grimmett, G., Stirzaker, D.: Probability and Random Processes, 3rd edn. Oxford University Press, Oxford (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Karaman, S., Frazzoli, E. (2010). Incremental Sampling-Based Algorithms for a Class of Pursuit-Evasion Games. In: Hsu, D., Isler, V., Latombe, JC., Lin, M.C. (eds) Algorithmic Foundations of Robotics IX. Springer Tracts in Advanced Robotics, vol 68. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17452-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-17452-0_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17451-3
Online ISBN: 978-3-642-17452-0
eBook Packages: EngineeringEngineering (R0)