基于改进蚁群算法的机器人路径规划

Tao Wang, Lianyu Zhao, Yunhui Jia, Jutao Wang
{"title":"基于改进蚁群算法的机器人路径规划","authors":"Tao Wang, Lianyu Zhao, Yunhui Jia, Jutao Wang","doi":"10.1109/WRC-SARA.2018.8584217","DOIUrl":null,"url":null,"abstract":"In the robot path planning, the basic ant colony algorithm is used to find the optimal path, there are some questions of long search time, low efficiency, and easily falling into local optimum. In this paper, the ant colony algorithm is improved for these problems. The introduction of artificial potential field method as the main means of path planning puts forward the principle of unbalanced initial pheromone. Different grid positions assign different initial pheromone and join pheromone trajectory smoothing strategy. Comparing the two kinds of ant colony algorithm and carrying on the simulation analysis, the improved ant colony algorithm is better than the basic ant colony mainly embodied in algorithm in searching ability, more efficient in algorithm and shorter the searching path. The experimental results show that the improved algorithm can improve the efficiency of the algorithm and restrain the algorithm from falling into the local optimum and realize the optimal path search of the robot so that the robot can quickly avoid the obstacle safely reaching the target point.","PeriodicalId":185881,"journal":{"name":"2018 WRC Symposium on Advanced Robotics and Automation (WRC SARA)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"36","resultStr":"{\"title\":\"Robot Path Planning Based on Improved Ant Colony Algorithm\",\"authors\":\"Tao Wang, Lianyu Zhao, Yunhui Jia, Jutao Wang\",\"doi\":\"10.1109/WRC-SARA.2018.8584217\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the robot path planning, the basic ant colony algorithm is used to find the optimal path, there are some questions of long search time, low efficiency, and easily falling into local optimum. In this paper, the ant colony algorithm is improved for these problems. The introduction of artificial potential field method as the main means of path planning puts forward the principle of unbalanced initial pheromone. Different grid positions assign different initial pheromone and join pheromone trajectory smoothing strategy. Comparing the two kinds of ant colony algorithm and carrying on the simulation analysis, the improved ant colony algorithm is better than the basic ant colony mainly embodied in algorithm in searching ability, more efficient in algorithm and shorter the searching path. The experimental results show that the improved algorithm can improve the efficiency of the algorithm and restrain the algorithm from falling into the local optimum and realize the optimal path search of the robot so that the robot can quickly avoid the obstacle safely reaching the target point.\",\"PeriodicalId\":185881,\"journal\":{\"name\":\"2018 WRC Symposium on Advanced Robotics and Automation (WRC SARA)\",\"volume\":\"94 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"36\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 WRC Symposium on Advanced Robotics and Automation (WRC SARA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WRC-SARA.2018.8584217\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 WRC Symposium on Advanced Robotics and Automation (WRC SARA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WRC-SARA.2018.8584217","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 36

摘要

在机器人路径规划中,采用基本蚁群算法寻找最优路径,存在搜索时间长、效率低、容易陷入局部最优的问题。针对这些问题,本文对蚁群算法进行了改进。引入人工势场法作为路径规划的主要手段,提出初始信息素不平衡原理。不同的网格位置分配不同的初始信息素,并加入信息素轨迹平滑策略。对比两种蚁群算法并进行仿真分析,改进蚁群算法在搜索能力上优于以算法为主的基本蚁群算法,算法效率更高,搜索路径更短。实验结果表明,改进算法可以提高算法效率,抑制算法陷入局部最优,实现机器人的最优路径搜索,使机器人能够快速避开障碍物,安全到达目标点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Robot Path Planning Based on Improved Ant Colony Algorithm
In the robot path planning, the basic ant colony algorithm is used to find the optimal path, there are some questions of long search time, low efficiency, and easily falling into local optimum. In this paper, the ant colony algorithm is improved for these problems. The introduction of artificial potential field method as the main means of path planning puts forward the principle of unbalanced initial pheromone. Different grid positions assign different initial pheromone and join pheromone trajectory smoothing strategy. Comparing the two kinds of ant colony algorithm and carrying on the simulation analysis, the improved ant colony algorithm is better than the basic ant colony mainly embodied in algorithm in searching ability, more efficient in algorithm and shorter the searching path. The experimental results show that the improved algorithm can improve the efficiency of the algorithm and restrain the algorithm from falling into the local optimum and realize the optimal path search of the robot so that the robot can quickly avoid the obstacle safely reaching the target point.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信