Kit Guan Lim, Yoong Hean Lee, M. K. Tan, H. Yoong, Tianlei Wang, K. Teo
{"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}
引用次数: 0
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.