mlsanityData to 7 Oct 2026

Efficient LiDAR Odometry for Autonomous Driving

arXiv 2104.10879 ↗First posted 22 Apr 2021cs.RO cs.CVcited by 7

Not on the map. Why?

Abstract (arXiv)

LiDAR odometry plays an important role in self-localization and mapping for autonomous navigation, which is usually treated as a scan registration problem. Although having achieved promising performance on KITTI odometry benchmark, the conventional searching tree-based approach still has the difficulty in dealing with the large scale point cloud efficiently. The recent spherical range image-based method enjoys the merits of fast nearest neighbor search by spherical mapping. However, it is not very effective to deal with the ground points nearly parallel to LiDAR beams. To address these issues, we propose a novel efficient LiDAR odometry approach by taking advantage of both non-ground spherical range image and bird's-eye-view map for ground points. Moreover, a range adaptive method is introduced to robustly estimate the local surface normal. Additionally, a very fast and memory-efficient model update scheme is proposed to fuse the points and their corresponding normals at different time-stamps. We have conducted extensive experiments on KITTI odometry benchmark, whose promising results demonstrate that our proposed approach is effective.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 5 of its 23 references that are in the map. First posted on arXiv 22 Apr 2021.

Builds on

5 of 23 references.

References · 5

  1. 2015ORB-SLAM: a Versatile and Accurate Monocular SLAM Systemcited by 983
  2. 2016Past, Present, and Future of Simultaneous Localization And Mapping: Towards the Robust-Perception Agecited by 405
  3. 2018IMLS-SLAM: scan-to-model matching based on 3D datacited by 40
  4. 2020Adaptive Robust Kernels for Non-Linear Least Squares Problemscited by 13
  5. 2019A New Approach to 3D ICP Covariance Estimationcited by 9

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 3; 2024: 1; 2025: 2.

7 papers.