改进蚁群算法的局部信息动态路径规划

Local Information Dynamic Path Planning Based on Improved Ant Colony Algorithm

摘要:

针对传统蚁群算法收敛速度慢、对动态路径变化适应性低的局限性,提出了一种基于局部信息获取策略的动态改进型蚁群算法。该算法利用局部信息获取策略,进行最优局部目标点的获取,然后调用改进蚁群算法获取局部区域内的最优路径,再重复循环获取新的最优局部目标点,直到找到全局目标点；与此同时,将提出的改进型蚁群算法应用于动态路径规划中的路径寻优与避障,仿真结果表明:提出的算法在具有与传统蚁群算法相当的路径优化效果的同时,能够有效适应障碍变化、大大提高了路径规划的收敛速度。

Abstract:

Considering the limitation of traditional ant colony algorithm's slowish convergence and bad self-adaptability to dynamic path change, a dynamic improved ant colony algorithm based on local information acquisition strategy is proposed in this paper. Firstly,The local information acquisition strategy is used to obtain the optimal local target point. Then, the improved ant colony algorithm is called to obtain the optimal path in the local region.And the new optimal local target point of the neighbor region is obtained by repeating the loop until the global target point is found. Moreover, the improved ant colony algorithm is applied to the path optimization and obstacle avoidance in dynamic path planning. The simulation results show that the new algorithm proposed not only has considerable path optimization performance compared with the traditional ant colony one, but also has self-adaptive capacity faced with time-vary obstacles and faster convergence speed.