计算机工程与应用2019，Vol.55Issue(11)：117-122,6.DOI:10.3778/j.issn.1002-8331.1808-0245
改进粒子群算法的三维空间路径规划研究
Research on Three-Dimensional Space Path Planning Based on Improved Particle Swarm Optimization Algorithm
摘要
Abstract
An adaptive chaotic particle swarm optimization algorithm(SACPSO)is proposed for three-dimensional space path planning. Firstly, the three-dimensional space environment modeling is carried out, and considers the three evaluation functions of path length, obstacle risk degree and path smoothness to formulate the fitness function. Then a new adaptive update strategy is proposed for the three control parameters in the algorithm, so as to dynamically adjust the global explo-ration and local exploitation capabilities of the algorithm. Finally, when the population falls into the local extremum, the proposed adaptive logistic chaotic map is used to optimize the global optimal particle and guide the population to jump out of the local extremum point. Comparing the algorithm with other improved particle swarm optimization algorithms, the results show that the algorithm uses fewer iterations when converging to the global optimal solution, and the quality of the generated path is higher, which effectively improves the computational efficiency and reliability of particle swarm optimization used in path planning problem in three-dimensional space.关键词
路径规划/三维空间/粒子群/自适应/Logistic混沌映射Key words
path planning/three-dimensional space/particle swarm/self-adaptive/Logistic chaotic map分类
信息技术与安全科学引用本文复制引用
杨超杰,裴以建,刘朋..改进粒子群算法的三维空间路径规划研究[J].计算机工程与应用,2019,55(11):117-122,6.基金项目
云南大学服务云南行动计划项目(No.KS161012). （No.KS161012）
