Vision-based initial localization of AGV and path planning with PO-JPS algorithm

IF 5 3区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
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 ,&nbsp;Hangyao Tu ,&nbsp;Sixian Chan ,&nbsp;Chengkan Huang ,&nbsp;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.

基于视觉的 AGV 初始定位和 PO-JPS 算法的路径规划
近年来,机器人路径规划备受关注。传统的自适应蒙特卡洛定位(AMCL)存在全局定位的局限性,以及跳点搜索(JPS)算法计算过多无意义节点导致的路径不完整、路径规划耗时长等问题。针对上述问题,本文提出了一种基于视觉的自动导引车(AGV)初始定位方法,并采用(剪枝优化)PO-JPS 算法进行路径规划。其核心内容包括:基于视觉的 AMCL 定位模块和基于剪枝优化的改进 JPS 算法。首先,从视觉采集的图像中提取定向快速和旋转简明(ORB)特征,并根据特征进行坐标定位,再结合激光 SLAM 的初始地图,构建字袋(BoW)特征库。通过比较 BoW 库中当前帧和历史帧之间的相似度,可获得与当前帧最相似的关键帧。计算这两个帧之间的欧拉变换,以进行姿态估计。该姿态作为初始值提供给 AMCL 进行粒子迭代。其次,在路径规划阶段,提出了一种基于剪枝优化的改进型 JPS 算法,并设计了一种删除寻路后补全路径中重复出现的中间拐点的策略。因此,在获得完整路径的同时,成功减少了节点扩展过程中无意义节点的计算工作量和内存消耗,提高了寻路算法的效率。最后,通过大量的仿真和物理实验验证了本文提出的方法,与原始的 JPS 算法相比节省了 17.7% 的时间,与 A* 算法相比节省了 279.6% 的时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Egyptian Informatics Journal
Egyptian Informatics Journal Decision Sciences-Management Science and Operations Research
CiteScore
11.10
自引率
1.90%
发文量
59
审稿时长
110 days
期刊介绍: 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.
×
引用
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学术官方微信