基于不均匀分配信息素及多目标优化的改进蚁群算法在无人船路径规划中的应用研究

Application of improved ant colony algorithm based on unevenly distributed pheromone and multi-objective optimization in unmanned vessel path planning

  • 摘要:
    目的 针对无人船在复杂水域中路径规划难度大的问题,提出一种基于不均匀分配信息素及多目标优化的改进蚁群优化(ACO)算法。
    方法 采用概率路线图法(PRM)得到一条初始路径,依据该路径和终点的方位信息指导ACO算法不均匀分配初始信息素,使得初始路径和终点附近的信息素浓度大,其他栅格的信息素浓度参照与两者的距离逐渐减少,改善蚂蚁在前期路径搜索盲目性大的问题,缩短计算时间;建立求解多目标路径规划问题的目标函数,通过设定权重来平衡安全指数、能耗和路径曲折度之间的关系,为不同的应用场景生成符合需求的多样化路径,并使信息素增量随路径的优劣进行自适应调整,以强化优质路径在整个蚁群中的影响;同时,设置启发式矩阵系数的自适应调整机制,引入与迭代次数相关的余弦调节因子,以提高ACO算法的寻优效率。对路径进行二次优化以获得全局最优路径,减少航行过程中的频繁转向和转弯幅度。最后,以黄石的“仙岛湖”和杭州的“千岛湖”两个真实湖泊为地图,通过实验将所提算法与其他传统的ACO算法、A*算法和改进ACO算法进行路径规划效果的比较。
    结果 结果显示,相比其他传统的ACO算法,所提算法规划的路径最短(减少61.71%),距离障碍物最远, 路径曲折度最小,运行时间也得到改善。
    结论 实验结果表明,所提算法可降低无人船的航行能耗,减少转弯次数与转弯幅度,提升路径的平滑性和安全性。

     

    Abstract:
    Objective Aiming at the difficulty of path planning for unmanned vehicles in complex waters, this paper proposes an improved ant colony optimization(ACO)algorithm based on uneven allocation of pheromone and multi-objective optimization.
    Methods First, a probabilistic roadmap method (PRM) is used to obtain an initial path, and based on the orientation data of the path and the endpoint, the ACO algorithm is guided to unevenly distribute the initial pheromone, which enables higher pheromone concentration of initial path and endpoint nearby and however decreases the pheromone concentration of other grids in mapping according to the initial path-endpoint distance. Therefore, the problem of the ants' blindness in the preliminary path search improved, the calculation time is shortened thereof. Next, an objective function is constructed for solving the multi-objective path planning problem, and the weights are set to balance the relationship among the safety index, the energy consumption, the tortuosity, so as to providing diversified path to meet the requirement for different scenarios, moreover adaptively adjust the increment of pheromone to strengthen the influence of high-quality path in the whole ants colony based on the pros and cons of the planed paths. Meanwhile, with the purpose of optimizing efficiency improvement, an adaptive adjustment strategy of heuristic matrix coefficient is established, incorporating cosine modulation factors pertaining to iteration numbers. For obtaining the global optimal path, quadratic optimization is carried out to reduce turns and turning amplitudes. Finally, on the basis of the maps of two real lakes—— the Lake Xiangdao in Huangshi and the Lake Qiandao in Hangzhou, the experiments are conducted to compare the effects of path planning using the proposed algorithm with that of other algorithms, i.e. traditional ACO, A* algorithm and improved ACO algorithm.
    Results The results indicate that the proposed algorithm has the shortest planning paths, which is 61.71% shorter than that of the traditional ACO algorithm, the farthest distance from obstacles, and the smallest tortuosity. The running time of the algorithm is also improved.
    Conclusion The experimental results show that the proposed algorithm can reduce the energy consumption of unmanned vessels in navigation, as well as the number of turns and turning amplitude, improving the smoothness and safety of the planned path.

     

/

返回文章
返回