摘要
根据对真实蚂蚁的最新研究成果,提出了一种全新的机器人路径规划蚂蚁算法.该算法由两组侦察蚁采用最近邻侦察搜索策略相向搜索出一条较优路径,再由一组觅食蚁通过在该路径附近觅食实现对该路径的优化,从而得到一条优化的路径.计算机仿真实验结果表明,算法收敛速度提高显著,且在障碍物非常复杂的地理环境,也能迅速规划出最优或基本最优的路径,效果令人满意.
According to the latest research achievements on actual ants,a new ant algorithm for robot path planning is presented. In the algorithm, two groups of scout ants collaborate to search for a near-optimal path by adopting neighborhood search strategy. Another group of foraging ants are used to optimize the path by foraging in the vicinity of the path, thus an optimal path is achieved. The results of computer simulation experiments show that the convergence speed of the algorithm has been significantly improved, and in a very complex geographical environment, it can also quickly work out the optimal or the basic optimal path. The effect is quite satisfying.
出处
《控制与决策》
EI
CSCD
北大核心
2009年第4期601-605,共5页
Control and Decision
基金
国家自然科学基金项目(60673102)
江苏省自然科学基金项目(Bk2006218)
