Summary
This paper presents an algorithm for a visibility-based pursuit-evasion problem in which bounds on the speeds of the pursuer and evader are given. The pursuer tries to find the evader inside of a simply-connected polygonal environment, and the evader in turn tries actively to avoid detection. The algorithm is at least as powerful as the complete algorithm for the unbounded speed case, and with the knowledge of speed bounds, generates solutions for environments that were previously unsolvable. Furthermore, the paper develops a characterization of the set of possible evader positions as a function of time. This characterization is more complex than in the unbound-speed case, because it no longer depends only on the combinatorial changes in the visibility region of the pursuer.
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
Aronov, B., Guibas, L., Teichmann, M., Zhang, L.: Visibility queries in simple polygons and applications. In: Chwa, K.-Y., H. Ibarra, O. (eds.) ISAAC 1998. LNCS, vol. 1533, Springer, Heidelberg (1998)
Crandall, M.G., Evans, L.C., Lions, P.L.: Some properties of viscosity solutions of hamilton-jacobi equations. Trans. Amer. Math. Soc. 282 (1984)
Gerkey, B., Thrun, S., Gordon, G.: Clear the building: Pursuit-evasion with teams of robots. In: Proceedings of the AAAI National Conference on Artificial Intelligence (2004)
Guibas, L.J., Latombe, J.-C., LaValle, S.M., Lin, D., Motwani, R.: Visibility-based pursuit-evasion in a polygonal environment. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 17–30. Springer, Heidelberg (1997)
Guilamo, L., Tovar, B., LaValle, S.M.: Pursuit-evasion in an unknown environment using gap navigation graphs. In: IEEE/RSJ Int. Conf. on Intelligent Robots & Systems (2004)
Hwang, I., Stipanovic, D., Tomlin, C.J.: Polytopic approximations of reachable sets applied to linear dynamic games and a class of nonlinear systems. In: Advances in Control, Communication Networks, and Transportation Systems In Honor of Pravin Varaiya (2005)
Isaacs, R.: Differential Games. Wiley, New York (1965)
Isler, V., Daniilidis, K., Pappas, G.J., Belta, C.: Hybrid control for visibility-based pursuit-evasion games. In: IEEE/RSJ Int. Conf. on Intelligent Robots & Systems (2004)
Isler, V., Kannan, S., Khanna, S.: Locating and capturing an evader in a polygonal environment. In: Workshop on the Algorithmic Foundations of Robotics (2004)
Kameda, T., Yamashita, M., Suzuki, I.: On-line polygon search by a six-state boundary 1-searcher. Technical Report CMPT-TR 2003-07, School of Computing Science, SFU (2003)
LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006), http://msl.cs.uiuc.edu/planning/
LaValle, S.M., Simov, B., Slutzki, G.: An algorithm for searching a polygonal region with a flashlight. International Journal of Computational Geometry and Applications 12(1-2), 87–113 (2002)
Sachs, S., Rajko, S., LaValle, S.M.: Visibility-based pursuit-evasion in an unknown planar environment. International Journal of Robotics Research (to appear, 2003)
Stipanovic, D.M., Hwang, U., Tomlin, C.J.: Computation of an over-approximation of the backward reachable set using subsystem level set functions. Dynamics Of Continuous Discrete And Impulsive Systems 11, 397–412 (2004)
Suzuki, I., Yamashita, M.: Searching for a mobile intruder in a polygonal region. SIAM J. Computing 21(5), 863–888 (1992)
Tovar, B., Guilamo, L., LaValle, S.M.: Gap navigation trees: Minimal representation for visibility-based tasks. In: Proc. Workshop on the Algorithmic Foundations of Robotics (2004)
Yavin, Y., Pachter, M.: Pursuit-Evasion Differential Games. Pergamon Press, Oxford (1987)
Yong, J.: On differential evasion games. SIAM J. Control & Optimization 26(1), 1–22 (1988)
Zaremba, L.S.: Differential games reducible to optimal control problems. In: IEEE Conf. Decision & Control, Tampa, pp. 2449–2450 (December 1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Tovar, B., LaValle, S.M. (2008). Visibility-Based Pursuit-Evasion with Bounded Speed. In: Akella, S., Amato, N.M., Huang, W.H., Mishra, B. (eds) Algorithmic Foundation of Robotics VII. Springer Tracts in Advanced Robotics, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68405-3_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-68405-3_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68404-6
Online ISBN: 978-3-540-68405-3
eBook Packages: EngineeringEngineering (R0)