Flight Path Planning Based on PSO and Minimum Threat Surface

Article Preview

Abstract:

Optimal flight path is restricted within Minimum Threat Surface (MTS). With Taylor’s expansion, the horizon projection of 3D flight path within MTS is fitted with a polynomial function with finite items. So the original path planning problem is simplified to search the optimals values in the coefficient space of the polynomial function. Flight path cost model of flight path is built and PSO is applied to search optimal coefficients. Flow of optimization is introduced and validated with three simulation cases. Simulation results show that MTS and PSO can effectively solve global optimization of 3D flight path.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

482-486

Citation:

Online since:

February 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Glenn Sander, Tapabrata Ray, C.: Optimal Offline Vehicle Path Planning of a Fixed Wing Unmanned Aerial using an Evolutionary Algorithm. In: IEEE International Congress on Evolutionary Computation, pp.4410-4416 (2007).

DOI: 10.1109/cec.2007.4425048

Google Scholar

[2] P.K.A. Menon, E. Kim, and V.H.L. Cheng: Optimal Trajectory Synthesis for Terrain-Following Flight. J. Journal of Guidance, Control and Dynamics. 14, 807-813 (2001).

DOI: 10.2514/3.20716

Google Scholar

[3] J. Kennedy, R. Eberhart: Particle Swarm Optimization. In: IEEE International Congress on Neural Networks, pp.549-556 (1995).

Google Scholar

[4] K. Li, Z.P. Wang: Coordinated Attack Path Planning for Multiple UAVs. J. Aeronautical Computing Technique. 36, 98-101 (2006).

Google Scholar