Dynamic route planning based on improved constrained differential evolution algorithm

被引:0
|
作者
Wu W.-H. [1 ]
Guo X.-F. [1 ]
Zhou S.-Y. [1 ]
机构
[1] Department of Aviation Control and Command, Qingdao Branch of Naval Aeronautics University, Qingdao
来源
Kongzhi yu Juece/Control and Decision | 2020年 / 35卷 / 10期
关键词
Constrained differential evolution; Dynamic route planning; Terrain following; Threat avoidance;
D O I
10.13195/j.kzyjc.2018.1732
中图分类号
学科分类号
摘要
Aiming at the problem of three-dimensional dynamic route planning for unmanned aerial vehicles (UAV), an improved constrained differential evolution (CDE) algorithm is proposed so as to meet the requirements of instantaneity and dynamic search accuracy. Firstly, this paper formulates the route planning problem for the UAV as a constrained optimization problem and constructs the objective functions and constraint functions according to the constraints of flight and threats. Then, the diversity, convergence and accuracy of the algorithm are improved through introducing generalized opposition-based learning and adaptive ranking mutation operators into the CDE algorithm. Finally, the adaptive trade-off model is applied to handle the constraints in each state, and the information of elite individual is fully utilized to achieve a reasonable conversion of the fitness. Experiment results and comparisons with 3 state-of-the-art CDEs show that the proposed method is able to plan a safe flight route which can implement static and dynamic threat avoidance effectively and realize terrain following. Compared with other three algorithms, the presented method has the advantages of terrific optimization performance, strong robustness, good convergence and high reliability. © 2020, Editorial Office of Control and Decision. All right reserved.
引用
收藏
页码:2381 / 2390
页数:9
相关论文
共 28 条
  • [1] Franco F, Olivier K, Philippe M., Improving relaxation-based constrained path planning via quadratic programming, International Conferenceor Intelligent Autonomous Systems, pp. 15-26, (2018)
  • [2] Matiussi Ramalho G, Carvalho S R, Finardi E C, Et al., Trajectory optimization using sequential convex programming with collision avoidance, Journal of Control, Automation and Electrical Systems, 29, 3, pp. 318-327, (2018)
  • [3] Zhang Z, Li J X, Wang J., Sequential convex programming for nonlinear optimal control problem in UAV path planning, Aerospace Science & Technology, 76, pp. 280-290, (2018)
  • [4] Willms A R, Yang S X., An efficient dynamic system for real-time robot-path planning, IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 36, 4, pp. 755-766, (2006)
  • [5] Li B L, Shi X L, Li J J, Et al., Dynamic path planning based on improved multivariant optimization algorithm, Acta Aeronautica et Astronautica Sinica, 36, 7, pp. 2319-2328, (2015)
  • [6] Zhao Y J, Zheng Z, Yang L., Survey on computational-intelligence-based UAV path planning, Knowledge-Based Systems, 158, pp. 54-64, (2018)
  • [7] Chen Y B, Yu J Q, Mei Y S, Et al., Modified central force optimization (MCFO) algorithm for 3D UAV path planning, Neurocomputing, 171, pp. 878-888, (2016)
  • [8] Roberge V, Tarbouchi M, Labonte G., Comparison of parallel genetic algorithm and particle swarm optimization for real-time UAV path planning, IEEE Transactions on Industrial Informatics, 9, 1, pp. 132-141, (2013)
  • [9] Zhang M, Jiang Z, Wang L, Et al., Research on parallel ant colony algorithm for 3D terrain path planning, Asian Simulation Conference, pp. 74-82, (2017)
  • [10] Pandey P, Shukla A, Tiwari R., Three-dimensional path planning for unmanned aerial vehicles using glowworm swarm optimization algorithm, International Journal of System Assurance Engineering and Management, 9, 4, pp. 836-852, (2018)