基于改进蚁群算法的全局路径规划方法研究
首发时间:2017-12-26
摘要:针对移动机器人全局路径规划采用传统蚁群算法存在收敛速度慢、易陷入局部最优的问题,提出基于改进蚁群算法的移动机器人全局路径规划方法。首先,以MAKLINK图论法构建环境模型,作为路径规划的基础。其次,根据环境的全局信息建立目标吸引函数,对机器人在复杂环境的路径搜索进行引导,提高其选择离目标点更近的邻近节点的概率,减小机器人对非最短路径的选择概率。借鉴自然选择原理对信息素进行更新,避免搜索陷入局部最优。最后,将改进的蚁群算法与传统蚁群算法进行仿真实验对比,实验结果证明了该方法可以更快地收敛到最优路径并具有较好的全局性能。
关键词: 蚁群算法 路径规划 MAKLINK图论法
For information in English, please click here
Research on Global Path Planning on Improved Ant Colony Algorithm
Abstract:Aiming at the problems of slow convergence speed and trapping into local minimum of global path planning for mobile robot by traditional ant colony algorithm, a global path planning for mobile robot based on improved ant colony algorithm is proposed in this paper. At first, the environment models with obstacle are established as the basis for path planning by MAKLINK graph. Secondly, the global information of working environment is adopted to establish target attraction function, which guide the ant colony to improve the probability of selecting the optimal path to the target point. Meanwhile, a rule updating the pheromone based on the natural selection principle is proposed, which solves the problem of getting into local optimum and increasing the convergence speed. Finally, the improved ant colony algorithm is compared with the traditional ant colony algorithm by simulation experiment, the proposed algorithm is verified to have a good dynamic performance and could converge to the sResearch on Global Path Planning on Improved Ant Colony Algorithmhortest path quickly.
Keywords: ant colony algorithm path planning MAKLINK graph
引用
No.****
同行评议
勘误表
基于改进蚁群算法的全局路径规划方法研究
评论
全部评论