Path Planning Based on Improved Ant Colony Algorithm

Yushuai Zhang, Jianxin Guo, Rui Zhu, Zhengyang Zhao, Liping Wang
{"title":"Path Planning Based on Improved Ant Colony Algorithm","authors":"Yushuai Zhang, Jianxin Guo, Rui Zhu, Zhengyang Zhao, Liping Wang","doi":"10.1109/ICVRIS51417.2020.00230","DOIUrl":null,"url":null,"abstract":"In order to overcome the problems of low accuracy and long time-consuming in traditional heuristic path planning algorithm, a new path planning method is proposed based on the improved Ant Colony (AC) algorithm. Different from the traditional AC algorithm worked with fix pheromone, the updatable pheromone is adopted by the improved AC algorithm to increase the diversity performance. Based on this advantage, the proposed path planning method has better accuracy and convergence performance. Simulation results show that the time-consuming of the proposed method is reduced effectively. And, the shortest path length of the proposed method is also shorter than the traditional heuristic path planning algorithm obviously.","PeriodicalId":162549,"journal":{"name":"2020 International Conference on Virtual Reality and Intelligent Systems (ICVRIS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Virtual Reality and Intelligent Systems (ICVRIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICVRIS51417.2020.00230","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In order to overcome the problems of low accuracy and long time-consuming in traditional heuristic path planning algorithm, a new path planning method is proposed based on the improved Ant Colony (AC) algorithm. Different from the traditional AC algorithm worked with fix pheromone, the updatable pheromone is adopted by the improved AC algorithm to increase the diversity performance. Based on this advantage, the proposed path planning method has better accuracy and convergence performance. Simulation results show that the time-consuming of the proposed method is reduced effectively. And, the shortest path length of the proposed method is also shorter than the traditional heuristic path planning algorithm obviously.
基于改进蚁群算法的路径规划
针对传统启发式路径规划算法精度低、耗时长等问题,提出了一种基于改进蚁群算法的路径规划方法。与传统的固定信息素的AC算法不同,改进的AC算法采用了可更新信息素来提高分集性能。基于这一优点,本文提出的路径规划方法具有更好的精度和收敛性能。仿真结果表明,该方法有效地减少了耗时。同时,该方法的最短路径长度也明显短于传统启发式路径规划算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信