基于进化算法的移动机器人导航自适应路径优化

Kit Guan Lim, Yoong Hean Lee, M. K. Tan, H. Yoong, Tianlei Wang, K. Teo
{"title":"基于进化算法的移动机器人导航自适应路径优化","authors":"Kit Guan Lim, Yoong Hean Lee, M. K. Tan, H. Yoong, Tianlei Wang, K. Teo","doi":"10.1109/IICAIET51634.2021.9573543","DOIUrl":null,"url":null,"abstract":"As technologies are advancing, demand for an intelligent mobile robot also increases. In autonomous robot design, the main problem faced by researchers is the path planning of mobile robot. Various kind of path planning algorithm was introduced in the past, but no algorithm has absolute superior towards the others algorithm. Classical methods like artificial potential field, grid search, and visual method have been easily overtaken by artificial intelligence due to its adaptability and ability to learn from the past mistakes or experience. For example, Ant Colony Optimization (ACO) is an optimization algorithm based on swarm intelligence which is widely used to solve path planning problem. However, the performance of ACO is highly dependent on the selection of its parameters. In this paper, the proposed adaptive ACO introduced two different ants, namely abnormal ant and random ant into the normal ACO to increase its global search ability and reduce the high convergence rate of ACO. Conventional ACO and adaptive ACO are compared in this paper and the results showed that adaptive ACO has better performance than conventional ACO in path planning.","PeriodicalId":234229,"journal":{"name":"2021 IEEE International Conference on Artificial Intelligence in Engineering and Technology (IICAIET)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Adaptive Route Optimization for Mobile Robot Navigation using Evolutionary Algorithm\",\"authors\":\"Kit Guan Lim, Yoong Hean Lee, M. K. Tan, H. Yoong, Tianlei Wang, K. Teo\",\"doi\":\"10.1109/IICAIET51634.2021.9573543\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As technologies are advancing, demand for an intelligent mobile robot also increases. In autonomous robot design, the main problem faced by researchers is the path planning of mobile robot. Various kind of path planning algorithm was introduced in the past, but no algorithm has absolute superior towards the others algorithm. Classical methods like artificial potential field, grid search, and visual method have been easily overtaken by artificial intelligence due to its adaptability and ability to learn from the past mistakes or experience. For example, Ant Colony Optimization (ACO) is an optimization algorithm based on swarm intelligence which is widely used to solve path planning problem. However, the performance of ACO is highly dependent on the selection of its parameters. In this paper, the proposed adaptive ACO introduced two different ants, namely abnormal ant and random ant into the normal ACO to increase its global search ability and reduce the high convergence rate of ACO. Conventional ACO and adaptive ACO are compared in this paper and the results showed that adaptive ACO has better performance than conventional ACO in path planning.\",\"PeriodicalId\":234229,\"journal\":{\"name\":\"2021 IEEE International Conference on Artificial Intelligence in Engineering and Technology (IICAIET)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE International Conference on Artificial Intelligence in Engineering and Technology (IICAIET)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IICAIET51634.2021.9573543\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Artificial Intelligence in Engineering and Technology (IICAIET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IICAIET51634.2021.9573543","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着技术的进步,对智能移动机器人的需求也在增加。在自主机器人设计中,研究人员面临的主要问题是移动机器人的路径规划。过去已经介绍了各种各样的路径规划算法,但没有一种算法比其他算法具有绝对优势。人工势场、网格搜索、视觉方法等经典方法由于其适应性和从过去的错误或经验中学习的能力,很容易被人工智能所取代。例如,蚁群优化算法(Ant Colony Optimization, ACO)是一种基于群体智能的优化算法,被广泛用于解决路径规划问题。然而,蚁群算法的性能在很大程度上取决于其参数的选择。本文提出的自适应蚁群算法在常规蚁群算法中引入异常蚁群和随机蚁群两种不同的蚁群,以提高蚁群算法的全局搜索能力,降低蚁群算法的高收敛速度。对比了传统蚁群算法和自适应蚁群算法,结果表明自适应蚁群算法在路径规划方面优于传统蚁群算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Adaptive Route Optimization for Mobile Robot Navigation using Evolutionary Algorithm
As technologies are advancing, demand for an intelligent mobile robot also increases. In autonomous robot design, the main problem faced by researchers is the path planning of mobile robot. Various kind of path planning algorithm was introduced in the past, but no algorithm has absolute superior towards the others algorithm. Classical methods like artificial potential field, grid search, and visual method have been easily overtaken by artificial intelligence due to its adaptability and ability to learn from the past mistakes or experience. For example, Ant Colony Optimization (ACO) is an optimization algorithm based on swarm intelligence which is widely used to solve path planning problem. However, the performance of ACO is highly dependent on the selection of its parameters. In this paper, the proposed adaptive ACO introduced two different ants, namely abnormal ant and random ant into the normal ACO to increase its global search ability and reduce the high convergence rate of ACO. Conventional ACO and adaptive ACO are compared in this paper and the results showed that adaptive ACO has better performance than conventional ACO in path planning.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信