首页 | 本学科首页   官方微博 | 高级检索  
     检索      

蚁群算法在全局最优路径寻优中的应用
引用本文:叶小勇,雷勇,侯海军.蚁群算法在全局最优路径寻优中的应用[J].系统仿真学报,2007,19(24):5643-5647.
作者姓名:叶小勇  雷勇  侯海军
作者单位:四川大学电气信息学院自动化系,四川,成都,610065
摘    要:移动机器人路径规划是机器人学的一个重要研究领域。针对移动场地的特点对其进行了建模与存储,然后将场地处理成简单的连通图,在此基础上对TSP模型进行了改进以应用到机器人全局最优路径中来,然后利用蚁群算法的基本原理在所建立的模型上进行全局最优路径搜索。为了更好的寻找到全局最优路径,对基本蚁群算法也做了一定的改进。不同的实验结果表明这种方法的确可以准确地找出全局最优路径。

关 键 词:蚁群算法  移动机器人  路径规划  全局寻优
文章编号:1004-731X(2007)24-5643-05
收稿时间:2006-10-13
修稿时间:2006-12-25

Application of Ant Colony Algorithm in Global Optimal Path Searching
YE Xiao-yong,LEI Yong,HOU Hai-jun.Application of Ant Colony Algorithm in Global Optimal Path Searching[J].Journal of System Simulation,2007,19(24):5643-5647.
Authors:YE Xiao-yong  LEI Yong  HOU Hai-jun
Abstract:The path planning problem of mobile robot is a quite important field for robotics. The model was constructed and stored according to the characteristic of environment and the ground was processed as simple Connective Graph. On the basis of the Connective Graph obtained above,the TSP model was transplanted for the global optimal path searching of mobile robot. The basic Ant Colony Algorithm(ACA) was improved for some content and then applied directly to search the Global Optimal Path(GOP) on the model constructed above. Different simulation results show that the method suggested can exactly search out the GOP actually.
Keywords:ant colony algorithm  mobile robot  path planning  global optimal path searching
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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