Abstract
This paper considers the problem of path planning for a team of unmanned aerial vehicles performing surveillance near a friendly base. The unmanned aerial vehicles do not possess sensors with automated target recognition capability and, thus, rely on communicating with unattended ground sensors placed on roads to detect and image potential intruders. The problem is motivated by persistent intelligence, surveillance, reconnaissance and base defense missions. The problem is formulated and shown to be intractable. A heuristic algorithm to coordinate the unmanned aerial vehicles during surveillance and pursuit is presented. Revisit deadlines are used to schedule the vehicles’ paths nominally. The algorithm uses detections from the sensors to predict intruders’ locations and selects the vehicles’ paths by minimizing a linear combination of missed deadlines and the probability of not intercepting intruders. An analysis of the algorithm’s completeness and complexity is then provided. The effectiveness of the heuristic is illustrated through simulations in a variety of scenarios.
Author supplied keywords
Cite
CITATION STYLE
Las Fargeas, J., Kabamba, P., & Girard, A. (2015). Cooperative surveillance and pursuit using unmanned aerial vehicles and unattended ground sensors. Sensors (Switzerland), 15(1), 1365–1388. https://doi.org/10.3390/s150101365
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.