Light-LOAM: A Lightweight LiDAR Odometry and Mapping Based on Graph-Matching

Shiquan Yi, Yang Lyu, Lin Hua, Quan Pan, Chunhui Zhao

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

Abstract

Simultaneous Localization and Mapping (SLAM) plays an important role in robot autonomy. Reliability and efficiency are the two most valued features for applying SLAM in robot applications. In this letter, we consider achieving a reliable LiDAR-based SLAM function in computation-limited platforms, such as quadrotor UAVs based on graph-based point cloud association. First, contrary to most works selecting salient features for point cloud registration, we propose a non-conspicuous feature selection strategy for reliability and robustness purposes. Then a two-stage correspondence selection method is used to register the point cloud, which includes a KD-tree-based coarse matching followed by a graph-based matching method that uses geometric consistency to vote out incorrect correspondences. Additionally, we propose an odometry approach where the weight optimizations are guided by vote results from the aforementioned geometric consistency graph. In this way, the optimization of LiDAR odometry rapidly converges and evaluates a fairly accurate transformation resulting in the back-end module efficiently finishing the mapping task. Finally, we evaluate our proposed framework on different datasets and real-world environments. Experiments show that our SLAM system achieves a comparative level or higher level of accuracy with more balanced computation efficiency compared with the mainstream LiDAR-based SLAM solutions.

Original languageEnglish
Pages (from-to)3219-3226
Number of pages8
JournalIEEE Robotics and Automation Letters
Volume9
Issue number4
DOIs
StatePublished - 1 Apr 2024

Keywords

  • SLAM
  • data association
  • localization

Fingerprint

Dive into the research topics of 'Light-LOAM: A Lightweight LiDAR Odometry and Mapping Based on Graph-Matching'. Together they form a unique fingerprint.

Cite this