Graph-based SLAM-aware exploration with prior topo-metric information

Autonomous exploration requires a robot to explore an unknown environment while constructing an accurate map using Simultaneous Localization and Mapping (SLAM) techniques. Without prior information, the exploration performance is usually conservative due to the limited planning horizon. This letter...

Full description

Saved in:
Bibliographic Details
Main Authors: Bai, Ruofei, Guo, Hongliang, Yau, Wei-Yun, Xie, Lihua
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2024
Subjects:
Online Access:https://hdl.handle.net/10356/180650
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-180650
record_format dspace
spelling sg-ntu-dr.10356-1806502024-10-16T05:41:55Z Graph-based SLAM-aware exploration with prior topo-metric information Bai, Ruofei Guo, Hongliang Yau, Wei-Yun Xie, Lihua School of Electrical and Electronic Engineering Institute for Infocomm Research, A*STAR Engineering Autonomous exploration Planning under uncertainty Autonomous exploration requires a robot to explore an unknown environment while constructing an accurate map using Simultaneous Localization and Mapping (SLAM) techniques. Without prior information, the exploration performance is usually conservative due to the limited planning horizon. This letter exploits prior information about the environment, represented as a topo-metric graph, to benefit both the exploration efficiency and the pose graph reliability in SLAM. Based on the relationship between pose graph reliability and graph topology, we formulate a SLAM-aware path planning problem over the prior graph, which finds a fast exploration path enhanced with the globally informative loop-closing actions to stabilize the SLAM pose graph. A greedy algorithm is proposed to solve the problem, where theoretical thresholds are derived to significantly prune non-optimal loop-closing actions, without affecting the potential informative ones. Furthermore, we incorporate the proposed planner into a hierarchical exploration framework, with flexible features including path replanning, and online prior graph update that adds additional information to the prior graph. Simulation and real-world experiments indicate that the proposed method can reliably achieve higher mapping accuracy than compared methods when exploring environments with rich topologies, while maintaining comparable exploration efficiency. Our method has been open-sourced on GitHub. Agency for Science, Technology and Research (A*STAR) National Research Foundation (NRF) This work was supported in part by the National Research Foundation, Singapore through Medium Sized Center for Advanced Robotics Technology Innovation and in part by Grant C221518004 from the Robotics HTCO, Agency for Science, Technology and Research (A*STAR), Singapore. ( 2024-10-16T05:39:51Z 2024-10-16T05:39:51Z 2024 Journal Article Bai, R., Guo, H., Yau, W. & Xie, L. (2024). Graph-based SLAM-aware exploration with prior topo-metric information. IEEE Robotics and Automation Letters, 9(9), 7597-7604. https://dx.doi.org/10.1109/LRA.2024.3420817 2377-3766 https://hdl.handle.net/10356/180650 10.1109/LRA.2024.3420817 2-s2.0-85197097225 9 9 7597 7604 en C221518004 IEEE Robotics and Automation Letters © 2024 IEEE. All rights reserved.
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Engineering
Autonomous exploration
Planning under uncertainty
spellingShingle Engineering
Autonomous exploration
Planning under uncertainty
Bai, Ruofei
Guo, Hongliang
Yau, Wei-Yun
Xie, Lihua
Graph-based SLAM-aware exploration with prior topo-metric information
description Autonomous exploration requires a robot to explore an unknown environment while constructing an accurate map using Simultaneous Localization and Mapping (SLAM) techniques. Without prior information, the exploration performance is usually conservative due to the limited planning horizon. This letter exploits prior information about the environment, represented as a topo-metric graph, to benefit both the exploration efficiency and the pose graph reliability in SLAM. Based on the relationship between pose graph reliability and graph topology, we formulate a SLAM-aware path planning problem over the prior graph, which finds a fast exploration path enhanced with the globally informative loop-closing actions to stabilize the SLAM pose graph. A greedy algorithm is proposed to solve the problem, where theoretical thresholds are derived to significantly prune non-optimal loop-closing actions, without affecting the potential informative ones. Furthermore, we incorporate the proposed planner into a hierarchical exploration framework, with flexible features including path replanning, and online prior graph update that adds additional information to the prior graph. Simulation and real-world experiments indicate that the proposed method can reliably achieve higher mapping accuracy than compared methods when exploring environments with rich topologies, while maintaining comparable exploration efficiency. Our method has been open-sourced on GitHub.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Bai, Ruofei
Guo, Hongliang
Yau, Wei-Yun
Xie, Lihua
format Article
author Bai, Ruofei
Guo, Hongliang
Yau, Wei-Yun
Xie, Lihua
author_sort Bai, Ruofei
title Graph-based SLAM-aware exploration with prior topo-metric information
title_short Graph-based SLAM-aware exploration with prior topo-metric information
title_full Graph-based SLAM-aware exploration with prior topo-metric information
title_fullStr Graph-based SLAM-aware exploration with prior topo-metric information
title_full_unstemmed Graph-based SLAM-aware exploration with prior topo-metric information
title_sort graph-based slam-aware exploration with prior topo-metric information
publishDate 2024
url https://hdl.handle.net/10356/180650
_version_ 1814777752427954176