摘要
针对蚁群算法中收敛速度和局部最优的矛盾,提出一种适用于静态环境的基于改进蚁群算法的移动机器人路径规划方法.在环境建模方面,利用机器人起点和终点的位置建立环境的可视图.改进的蚁群算法将环境中局部的路径信息加入到信息素的初始化和路径选择概率中,提高了算法收敛速度的同时尽可能地避免算法早熟.当算法陷入停滞时,引入交叉操作并调整α,β和ρ的值,增加了算法的逃逸能力.仿真结果证明了所提方法提高了最优路径的搜索效率,整体性能优于标准蚁群算法.
To solve the contradictory between the convergence speed and the local optimum in ant colony algorithm, an improved ant colony optimization algorithm （IACO） was proposed for path planning of mobile robot in the static environment. The locations of start and goal were utilized to build the environmental model based on the simplified visibility graph. In IACO, the local path information was integrated with the initialization of pheromone and the selected probabilities of the paths, resulting in improving the convergence speed and avoiding the premature phenomenon as far as possible. For overcoming the possible stagnation phenomenon, crossover operation is drawn into the proposed algorithm and the value of α、βand ρ were updated, which enhanced the capability of escaping stagnation phenomenon. The simulation results demonstrated that the search efficiency of optimum path and the overall performance of the proposed algorithm were improved to be better than that of standard ACO.
出处
《东北大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2013年第11期1521-1524,共4页
Journal of Northeastern University(Natural Science)
基金
山东省自然科学基金资助项目(ZR2011FM005)
关键词
移动机器人
环境建模
简化可视图
蚁群算法
路径规划
mobile robot
environment modeling
visibility graph
ant colony optimization（ACO）
path planning
作者简介
张琦（1982-），男，辽宁沈阳人，哈尔滨工业大学博士研究生
马家辰（1964-），男，黑龙江佳木斯人，哈尔滨工业大学教授，博士生导师．
