Surveillance for security as a pursuit-evasion game

8Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This work addresses a visibility-based target tracking problem that arises in autonomous surveillance for covert security applications. Consider a mobile observer, equipped with a camera, tracking a target in an environment containing obstacles. The interaction between the target and the observer is assumed to be adversarial in order to obtain control strategies for the observer that guarantee some tracking performance. Due to the presence of obstacles, this problem is formulated as a game with state constraints. Based on our previous work in [6] which shows the existence of a value function, we present an off-line solution to the problem of computing the value function using a Fast Marching Semi- Lagrangian numerical scheme, originally presented in [15]. Then we obtain the optimal trajectories for both players, and compare the performance of the current scheme with the Fully Discrete Semi-Lagrangian Scheme presented in [6] based on simulation results.

Cite

CITATION STYLE

APA

Bhattacharya, S., Başar, T., & Falcone, M. (2014). Surveillance for security as a pursuit-evasion game. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8840, 370–379. https://doi.org/10.1007/978-3-319-12601-2_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free