变异扩散蚁群算法求解战区潜艇三维路径规划问题

THREE-DIMENSIONAL PATH PLANNING OF SUBMARINE IN WAR ZONE BASED ON MUTATION DIFFUSION ANT COLONY ALGORITHM

针对战区潜艇海底三维路径规划问题,提出一种变异扩散蚁群算法。该算法通过极值限定策略限制了信息素浓度范围防止信息素浓度差异太大导致算法停滞,而后采用变异机制快速增加个体多样性提高算法精度,再采用信息素扩散策略加强距离较近蚂蚁之间的合作交流加快算法收敛。用该算法与传统蚁群算法、遗传算法和粒子群算法求解四个潜艇三维路径规划实例,结果表明变异扩散蚁群算法拥有更好的性能,对三维路径规划问题有着良好的适应性。

Aimed at the problem of submarine three-dimensional path planning in warfare submarines, a mutation-diffusion ant colony algorithm is proposed. This algorithm limited the pheromone concentration range through the extreme value limiting strategy to prevent the pheromone concentration difference from being too large and causing the algorithm to stall. The mutation mechanism was used to quickly increase the diversity of individuals to improve the accuracy of the algorithm. The pheromone diffusion strategy was used to strengthen the cooperative communication between ants that are closer to accelerate the convergence of the algorithm. The proposed algorithm and traditional ant colony algorithm, genetic algorithm, particle swarm algorithm were used to solve four submarine three-dimensional path planning examples. The results show that the mutant diffusion ant colony algorithm has better performance and has good adaptability to the three-dimensional path planning problem.