Fast 3D Path Pre-Planning Method for UAVs

Abstract:

Path pre-planning generate the feasible conference path between start and destination for UAVs, it relates to restrictions from UAVs itself and environment information. Generally, the path is produced by searching in configuration space with some intelligent searching algorithms, the space is always so huge that it is difficult to obtain high efficiency, even lead to NP hard. We proposed a fast 3D path pre-planning method which plan 2D path firstly and then process height planning based on obtained 2D path, considering typical constraints such as turning angle, climbing/diving angle and static threat avoidance. Fast Marching Method (FMM) and Sparse A-Star (SAS) searching method are used in the course of 2D path planning and height planning respectively, Experiments showed that the proposed method generates path quickly, the obtained path follows terrain and avoids obstacles well.

• Periodical: Applied Mechanics and Materials (Volumes 278-280)
• Pages: 1676-1681
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.278-280.1676
• Online since: January 2013
• Authors: Shi Dong Li, Song Liu, Qing Ai, Jun Li
• Keywords: Environment Constraints, FMM, Ontological Constraints, Path Pre-Planning, SAS

References

[1] Z. Changwen, D. Mingyue, An Evolutionary Real-Time 3D Route Planner for Aircraft , Journal of Systems Engineering and Electronics. 14(2003), 47-53.

[2] B. M. Baker, M. Ayechew, A genetic algorithm for the vehicle routing problem , Computers & Operations Research. 30(2003), 787-800.

DOI: 10.1016/s0305-0548(02)00051-5

[3] S. Li, S. Xiuxia, X. Yuejian, Particle Swarm Optimization for Route Planning of Unmanned Aerial Vehicles, IEEE International Conference on Information Acquisition. (2006), 1213-1218.

DOI: 10.1109/icia.2006.305920

[4] X. Yu, Y. Sun, J. Liu, B. Chen, Autonomous Navigation for Unmanned Aerial Vehicles Based on Chaotic Bionics Theory , Journal of Bionic Engineering. 6(2009), 270-279.

DOI: 10.1016/s1672-6529(08)60123-7

[5] K. Ghoseiri, B. Nadjari, An ant colony optimization algorithm for the bi-objective shortest path problem , Applied Soft Computing. 10(2010), 1237-1246.

DOI: 10.1016/j.asoc.2009.09.014

[6] D. Fuguang, J. Peng, B. Xinqian, W. Hongjian, AUV local path planning based on virtual potential field, IEEE International Conference on Mechatronics and Automation. (2006), 1711-1716.

DOI: 10.1109/icma.2005.1626816

[7] Y. Marinakis, M. Marinaki, G. Dounias, Honey Bees Mating Optimization algorithm for large scale vehicle routing problems , Natural Computing. 9(2010), 5-27.

DOI: 10.1007/s11047-009-9136-x

[8] E. Rouy, A. Tourin, A viscosity solutions approach to shape-from-shading, SIAM Journal on Numerical Analysis. 29(1992), 867-884.

DOI: 10.1137/0729053

[9] J. Sethian, Fast marching methods , SIAM review. 41 ( 1999), 199-235.

DOI: 10.1137/s0036144598347059

[10] L. Shidong, D. Mingyue, C. Chao, A novel path planning method based on path network, SPIE-The International Society for Optical Engineering. (2009), 749710-749718.