An improved ant colony algorithm for the path planning of robot is proposed.The grid map model and tabu list were set up by using the ant colony algorithms.At the same time,to solve the deadlock problem,it was suggest to discard the ants trapped in the deadlock.When the number of the ant iteration was greater than 60 generations,the speed of algorithm convergence was increased by reducing the strength coefficient of pheromone Q.The experiment results show that the improved algorithm can plan the optimal path quickly,and avoid deadlock and local optimization.%针对机器人路径规划问题,提出一种改进的蚁群算法.建立栅格地图模型,结合蚁群算法,设置禁忌表,同时针对死锁问题,提出丢弃陷入死锁的蚂蚁;当蚂蚁迭代次数大于60代后,通过减小信息素增强系数Q,达到提高算法收敛速度的目的.实验结果表明,改进后的算法能快速规划出最优路径,同时能避免陷入死锁和局部优化.
展开▼
