An improved ant colony algorithm based on Q-Learning for route planning of autonomous vehicle

Liping Zhao, Feng Li, Dongye Sun, Zihan Zhao
{"title":"An improved ant colony algorithm based on Q-Learning for route planning of autonomous vehicle","authors":"Liping Zhao, Feng Li, Dongye Sun, Zihan Zhao","doi":"10.15837/ijccc.2024.3.5382","DOIUrl":null,"url":null,"abstract":"In view of the problems existing in the path planning algorithms of unmanned vehicles, such as low search efficiency, slow convergence speed and easy to fall into the local optimal. Based on the characteristics of route planning for unmanned vehicles, this paper introduces Q-Learning into the traditional ant colony algorithm to enhance the learning ability of the algorithm in dynamic environment, so as to improve the overall efficiency of route search. By mapping pheromones into Q values in Q-learning, rapid search in complex environments is realized, and a collection-free path satisfying constraints is quickly found. The results of case analysis show that compared with the traditional ant colony algorithm and the improved ant colony algorithm considering reward and punishment factors, the improved ant colony algorithm based on Q-Learning can effectively reduce the number of iterations, shorten the path optimization time and path length and other performance indicators, and has many advantages in jumping out of the local optimal, improving the global search ability and improving the convergence speed, and has good adaptability and robustness in complex environments. It ensures the safety and stability of unmanned vehicles in complex environments.","PeriodicalId":386672,"journal":{"name":"INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL","volume":"84 2","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15837/ijccc.2024.3.5382","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In view of the problems existing in the path planning algorithms of unmanned vehicles, such as low search efficiency, slow convergence speed and easy to fall into the local optimal. Based on the characteristics of route planning for unmanned vehicles, this paper introduces Q-Learning into the traditional ant colony algorithm to enhance the learning ability of the algorithm in dynamic environment, so as to improve the overall efficiency of route search. By mapping pheromones into Q values in Q-learning, rapid search in complex environments is realized, and a collection-free path satisfying constraints is quickly found. The results of case analysis show that compared with the traditional ant colony algorithm and the improved ant colony algorithm considering reward and punishment factors, the improved ant colony algorithm based on Q-Learning can effectively reduce the number of iterations, shorten the path optimization time and path length and other performance indicators, and has many advantages in jumping out of the local optimal, improving the global search ability and improving the convergence speed, and has good adaptability and robustness in complex environments. It ensures the safety and stability of unmanned vehicles in complex environments.
基于 Q-Learning 的改进型蚁群算法用于自动驾驶汽车的路线规划
针对无人车路径规划算法中存在的搜索效率低、收敛速度慢、易陷入局部最优等问题。本文根据无人车路径规划的特点,在传统蚁群算法中引入 Q 学习,增强算法在动态环境下的学习能力,从而提高路径搜索的整体效率。通过将信息素映射为 Q-learning 中的 Q 值,实现了在复杂环境中的快速搜索,并能快速找到满足约束条件的无集合路径。实例分析结果表明,与传统蚁群算法和考虑奖惩因素的改进蚁群算法相比,基于 Q-Learning 的改进蚁群算法能有效减少迭代次数,缩短路径优化时间和路径长度等性能指标,在跳出局部最优、提高全局搜索能力、提高收敛速度等方面具有诸多优势,在复杂环境中具有良好的适应性和鲁棒性。它确保了无人飞行器在复杂环境中的安全性和稳定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书