Share Email Print

Proceedings Paper

A dynamic path planning algorithm for UAV tracking
Author(s): Hongda Chen; K. C. Chang; Craig S. Agate
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A dynamic path-planning algorithm is proposed for UAV tracking. Based on tangent lines between two dynamic UAV turning and objective circles, analytical optimal path is derived with UAV operational constraints given a target position and the current UAV dynamic state. In this paper, we first illustrate that path planning for UAV tracking a ground target can be formulated as an optimal control problem consisting of a system dynamic, a set of boundary conditions, control constraints and a cost criterion. Then we derive close form solution to initiate dynamic tangent lines between UAV turning limit circle and an objective circle, which is a desired orbit pattern over a target. Basic tracking strategies are illustrated to find the optimal path for UAV tracking. Particle filter method is applied as a target is moving on a defined road network. Obstacle avoidance strategies are also addressed. With the help of computer simulations, we showed that the algorithm provides an efficient and effective tracking performance in various scenarios, including a target moving according to waypoints (time-based and/or speed-based) or a random kinematics model.

Paper Details

Date Published: 11 May 2009
PDF: 10 pages
Proc. SPIE 7336, Signal Processing, Sensor Fusion, and Target Recognition XVIII, 73360B (11 May 2009); doi: 10.1117/12.819836
Show Author Affiliations
Hongda Chen, George Mason Univ. (United States)
K. C. Chang, George Mason Univ. (United States)
Craig S. Agate, Toyon Research Corp. (United States)

Published in SPIE Proceedings Vol. 7336:
Signal Processing, Sensor Fusion, and Target Recognition XVIII
Ivan Kadar, Editor(s)

© SPIE. Terms of Use
Back to Top