TY - JOUR
T1 - Dual-Layer Path Planning with Pose SLAM for Autonomous Exploration in GPS-Denied Environments
AU - Zhang, Shi
AU - Cui, Rongxin
AU - Yan, Weisheng
AU - Li, Yinglin
N1 - Publisher Copyright:
© 1982-2012 IEEE.
PY - 2024/5/1
Y1 - 2024/5/1
N2 - Robot exploration in GPS-denied environments is a significant challenge due to the lack of reliable localization strategies. In this article, we propose a dual-layer planning approach with pose SLAM for autonomous robot exploration, which consists of local and global planners. The local planner uses the iteratively built local tree to generate candidate paths, and assesses the optimal path using a utility function that trades off exploration efficiency with localization accuracy. When the local planner is unable to return the admissible paths, the global planner is engaged to search an incrementally built graph for a path, which can reposition the robot to a previously identified valuable pose. For global path searching, we improve the Dijkstra algorithm and propose a cost function that considers localization uncertainty to generate a path with low localization error. In addition, we present a mixed filter on Lie group to estimate state information of paths for planners online. Finally, the proposed method is evaluated in challenging simulations and real-world environments. Comparison experiments show that our method is more efficient than the existing methods in exploring GPS-denied environments.
AB - Robot exploration in GPS-denied environments is a significant challenge due to the lack of reliable localization strategies. In this article, we propose a dual-layer planning approach with pose SLAM for autonomous robot exploration, which consists of local and global planners. The local planner uses the iteratively built local tree to generate candidate paths, and assesses the optimal path using a utility function that trades off exploration efficiency with localization accuracy. When the local planner is unable to return the admissible paths, the global planner is engaged to search an incrementally built graph for a path, which can reposition the robot to a previously identified valuable pose. For global path searching, we improve the Dijkstra algorithm and propose a cost function that considers localization uncertainty to generate a path with low localization error. In addition, we present a mixed filter on Lie group to estimate state information of paths for planners online. Finally, the proposed method is evaluated in challenging simulations and real-world environments. Comparison experiments show that our method is more efficient than the existing methods in exploring GPS-denied environments.
KW - Autonomous exploration
KW - informative path planning
KW - path planning
KW - pose simultaneous localization and mapping (SLAM)
UR - http://www.scopus.com/inward/record.url?scp=85163771370&partnerID=8YFLogxK
U2 - 10.1109/TIE.2023.3288187
DO - 10.1109/TIE.2023.3288187
M3 - 文章
AN - SCOPUS:85163771370
SN - 0278-0046
VL - 71
SP - 4976
EP - 4986
JO - IEEE Transactions on Industrial Electronics
JF - IEEE Transactions on Industrial Electronics
IS - 5
ER -