首页 | 官方网站   微博 | 高级检索  
     

基于改进蚁群算法的移动机器人路径规划
引用本文:李果,刘少军.基于改进蚁群算法的移动机器人路径规划[J].控制工程,2005,12(5):473-475,485.
作者姓名:李果  刘少军
作者单位:中南大学,机电工程学院,湖南,长沙,410083
摘    要:针对移动机器人规避障碍和寻找最优路径问题,提出一种基于改进的蚁群算法的解决策略,并编制相应程序进行验证。仿真过程分为两个基本阶段:适应阶段和协同工作阶段。在前阶段,各局部解根据规则不断调整自身结构;后阶段各局部解通过信息交流,产生全局最优解。与传统的算法比较,它可以避免陷入过早收敛,能实现移动机器人在较短时间内找到最佳路径并规避障碍。

关 键 词:蚁群算法  移动机器人  目标寻我  障碍规避  路径规划
文章编号:1671-7848(2005)05-0473-04
收稿时间:2004-10-18
修稿时间:2004-11-09

Path Planning of Mobile Robot Based on Improved Ant Colony Algorithm
LI Guo,LIU Shao-jun.Path Planning of Mobile Robot Based on Improved Ant Colony Algorithm[J].Control Engineering of China,2005,12(5):473-475,485.
Authors:LI Guo  LIU Shao-jun
Abstract:The problems of obstacle avoidance and path planning of mobile robot are discussed. A possible solution using the improved ant colony algorithm is presented to find a best path without collision from the starting-point to the ending-point.According to the simulation,the test process includes two steps: the meet stage and the cooperation.All local solutions adjust themselves;and then the global solutions is found. The result shows that the mobile robot can find the goal within the shortest path without the collision and the stagnation.
Keywords:ant colony algorithm  mobile robot  goal seeking  obstacle avoidance  path planning
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号