基于改进蚁群算法的移动机器人全局路径规划*

作者：章小兵，乔茹，赵光兴 日期：2009-04-21/span> 浏览：3308 查看PDF文档

基于改进蚁群算法的移动机器人全局路径规划*

章小兵，乔茹，赵光兴
（安徽工业大学 电气信息学院，安徽 马鞍山 243002）

摘要：为提高机器人全局路径规划的通用性，将机器人的环境地图分为目标点在障碍物内和障碍物外两种情况，采用了伪随机比例规则和随机选择机制，使蚂蚁下一节点的选择在倾向于目标点的同时又不会陷入局部最优解，既提高了蚂蚁的搜索效率又扩展了搜索范围，并采用最大-最小蚂蚁思想来限制信息素的强度以防止早熟收敛现象的发生。为提高算法的实用性，运用几何方法对路径进行了修正处理，实现了机器人的快速全局路径规划。仿真研究表明：该算法具有较强的通用性、实用性和路径较优的特点。
关键词：移动机器人；路径规划；蚁群算法；随机选择机制
中图分类号：TP24文献标识码：A文章编号：1001-4551(2009)03-0090-04

Global path planning of mobile robot based on improved ant colony algorithm
ZHANG Xiao-bing, QIAO Ru, ZHAO Guang-xing
(School of Electrical Engineering & Information, Anhui University of Technology, Maanshan 243002, China)
Abstract: Aiming at enhancing the versatility of global path planning of mobile robot, disparting the robots working spaces that the goal was inside the obstacles and outside the obstacles, the pseudorandom proportion rule and the random choice mechanism were used in order to make the choice of ant colonys path incline goal and not get into local optimization .Maxmin ant system which could limit global pheromone intensity was adopted to prevent the precocious convergence. Path was modified by geometry method to enhance the arithmetics practicability. Global path planning of mobile robot was realized. Simulation results show that the characteristics of the proposed method are powerful universal capability , practicability and good paths.
Key words: mobile robot; path planning; ant colony algorithm; random choice mechanism
参考文献(References):
［1］ALEXOPOULOS C, GRIFFIN P M. Path planning for a mobile robot［J］. IEEE Transactions on Systems, Man, and Cybernetics,1992,22(2):318-322.
［2］PARK M G, LEE M C. Artificial Potential Field based Path Planning for Mobile Robots using a Virtual Obstacle Concept［C］//IEEE/ASME International Conference on Advanced Intelligent Mechatronics. Kobe:[s.n.],2003:735-740.
［3］ZHAO D B, YI J Q. Lecture Notes in Computer Science［M］. Heidelberg: Springer Berlin,2006.
［4］于红斌,李孝安.基于栅格法的机器人快速路径规划［J］.微电子学与计算机,2005,22(6):98-100.
［5］国海涛,朱庆保,徐守江.基于栅格法的机器人路径规划快速搜索随机树算法［J］.南京师范大学学报：工程技术版,2007,7(2):58-61.
［6］司应涛,朱庆保,国海涛.基于正反馈遗传算法的机器人全局路径规划［J］.计算机工程与应用,2008,44(1):54-56.
［7］曲道奎,杜振军，徐殿国，等.移动机器人路径规划方法研究［J］.机器人,2008,30(2):97-101.
［8］王俭,肖金球.一种改进的机器人路径规划蚂蚁算法［J］.微计算机信息,2005,21(5):53-54.
［9］詹士昌,徐婕,吴俊.蚁群算法中有关算法参数的最优选择［J］.科技通报,2003,19(5):381-386.
［10］段海滨.蚁群算法原理及其应用［M］.北京：科学出版社,2006.
［11］李士勇.蚁群算法及其应用［M］.哈尔滨：哈尔滨工业大学出版社，2004.
［12］魏宁,刘一松.基于栅格模型的移动机器人全局路径规划研究［J］.机器人技术,2008,24(11):229-231.
［13］胡香玲，李宪章，冯浩，等.一种新型机器人多自由度关节的路径规划方法[J].机电工程,2006,23(2):58-62.