Zheng Wang , Hangyao Tu , Sixian Chan , Chengkan Huang , Yanwei Zhao
{"title":"Vision-based initial localization of AGV and path planning with PO-JPS algorithm","authors":"Zheng Wang , Hangyao Tu , Sixian Chan , Chengkan Huang , Yanwei Zhao","doi":"10.1016/j.eij.2024.100527","DOIUrl":null,"url":null,"abstract":"<div><p>In recent years, robot path planning has gained high attention. The traditional adaptive Monte Carlo localization (AMCL) has such problems as limitations in global localization, and incomplete path and time-consuming problem in path planning due to too much calculation of meaningless nodes by the jump point search (JPS) algorithm. In view of the above problems, this paper proposed a method for vision-based initial localization of automated guided vehicle (AGV) and path planning with (pruning optimization) PO-JPS algorithm. The core contents include: vision-based AMCL localization module and improved JPS algorithm based on pruning optimization. Firstly, Oriented FAST and Rotated BRIEF (ORB) features are extracted from the images collected by vision, and coordinates are localized with the features, coupled with the initial map by laser SLAM, to construct a bag-of-words (BoW) library of features. The key frame most similar to the current one is obtained by comparing the similarity between the current and historical frames in the BoW library. The Euler transformation between these two frames is calculated, to carry out pose estimation. This pose, as an initial value, is provided to the AMCL for particle iteration. Secondly, in the path planning stage, an improved JPS algorithm based on pruning optimization is proposed, and a strategy that the repeated intermediate inflection points in the complemented path after pathfinding are deleted is designed. Therefore, while a complete path is obtained, the calculation workload and memory consumption for meaningless nodes during node extension are reduced successfully, and the efficiency of the pathfinding algorithm is raised. Finally, verification of the method proposed in this paper is completed through a large number of simulations and physical experiments, which saved 17.7% of the time compared to the original JPS algorithm and 279.6% to the A* algorithm.</p></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":null,"pages":null},"PeriodicalIF":5.0000,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1110866524000902/pdfft?md5=d39015f935bd8a59d4c7e6ca09c22d46&pid=1-s2.0-S1110866524000902-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Egyptian Informatics Journal","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1110866524000902","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
In recent years, robot path planning has gained high attention. The traditional adaptive Monte Carlo localization (AMCL) has such problems as limitations in global localization, and incomplete path and time-consuming problem in path planning due to too much calculation of meaningless nodes by the jump point search (JPS) algorithm. In view of the above problems, this paper proposed a method for vision-based initial localization of automated guided vehicle (AGV) and path planning with (pruning optimization) PO-JPS algorithm. The core contents include: vision-based AMCL localization module and improved JPS algorithm based on pruning optimization. Firstly, Oriented FAST and Rotated BRIEF (ORB) features are extracted from the images collected by vision, and coordinates are localized with the features, coupled with the initial map by laser SLAM, to construct a bag-of-words (BoW) library of features. The key frame most similar to the current one is obtained by comparing the similarity between the current and historical frames in the BoW library. The Euler transformation between these two frames is calculated, to carry out pose estimation. This pose, as an initial value, is provided to the AMCL for particle iteration. Secondly, in the path planning stage, an improved JPS algorithm based on pruning optimization is proposed, and a strategy that the repeated intermediate inflection points in the complemented path after pathfinding are deleted is designed. Therefore, while a complete path is obtained, the calculation workload and memory consumption for meaningless nodes during node extension are reduced successfully, and the efficiency of the pathfinding algorithm is raised. Finally, verification of the method proposed in this paper is completed through a large number of simulations and physical experiments, which saved 17.7% of the time compared to the original JPS algorithm and 279.6% to the A* algorithm.
期刊介绍:
The Egyptian Informatics Journal is published by the Faculty of Computers and Artificial Intelligence, Cairo University. This Journal provides a forum for the state-of-the-art research and development in the fields of computing, including computer sciences, information technologies, information systems, operations research and decision support. Innovative and not-previously-published work in subjects covered by the Journal is encouraged to be submitted, whether from academic, research or commercial sources.