pith. sign in

arxiv: 2107.06829 · v1 · pith:5E3RGACRnew · submitted 2021-07-14 · 💻 cs.RO

FAST-LIO2: Fast Direct LiDAR-inertial Odometry

classification 💻 cs.RO
keywords fast-lio2treeaccuracydatafastikd-treelidar-inertiallidars
0
0 comments X
read the original abstract

This paper presents FAST-LIO2: a fast, robust, and versatile LiDAR-inertial odometry framework. Building on a highly efficient tightly-coupled iterated Kalman filter, FAST-LIO2 has two key novelties that allow fast, robust, and accurate LiDAR navigation (and mapping). The first one is directly registering raw points to the map (and subsequently update the map, i.e., mapping) without extracting features. This enables the exploitation of subtle features in the environment and hence increases the accuracy. The elimination of a hand-engineered feature extraction module also makes it naturally adaptable to emerging LiDARs of different scanning patterns; The second main novelty is maintaining a map by an incremental k-d tree data structure, ikd-Tree, that enables incremental updates (i.e., point insertion, delete) and dynamic re-balancing. Compared with existing dynamic data structures (octree, R*-tree, nanoflann k-d tree), ikd-Tree achieves superior overall performance while naturally supports downsampling on the tree. We conduct an exhaustive benchmark comparison in 19 sequences from a variety of open LiDAR datasets. FAST-LIO2 achieves consistently higher accuracy at a much lower computation load than other state-of-the-art LiDAR-inertial navigation systems. Various real-world experiments on solid-state LiDARs with small FoV are also conducted. Overall, FAST-LIO2 is computationally-efficient (e.g., up to 100 Hz odometry and mapping in large outdoor environments), robust (e.g., reliable pose estimation in cluttered indoor environments with rotation up to 1000 deg/s), versatile (i.e., applicable to both multi-line spinning and solid-state LiDARs, UAV and handheld platforms, and Intel and ARM-based processors), while still achieving higher accuracy than existing methods. Our implementation of the system FAST-LIO2, and the data structure ikd-Tree are both open-sourced on Github.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Online Structure Learning and Planning for Autonomous Robot Navigation using Active Inference

    cs.RO 2025-10 conditional novelty 7.0

    AIMAPP unifies online topological mapping, localisation, and planning under a single active-inference generative model for self-supervised robot navigation.

  2. G-EDF-Loc: 3D Continuous Gaussian Distance Field for Robust Gradient-Based 6DoF Localization

    cs.RO 2026-04 unverdicted novelty 6.0

    G-EDF-Loc models the Euclidean distance field as a block-sparse Gaussian mixture to enable real-time, gradient-based 6DoF localization that remains robust under severe odometry degradation or without IMU priors.

  3. G-DRAGON: Geospatial Reasoning and Dynamic Planning for Retrieval-Augmented Outdoor Navigation

    cs.RO 2026-05 unverdicted novelty 5.0

    G-DRAGON framework maps language commands to OSM coordinates via lightweight LLM for global planning and uses frontier exploration for local targets, outperforming baselines in simulation and completing real UGV perso...

  4. Bio-Inspired Topological Autonomous Navigation with Active Inference in Robotics

    cs.RO 2025-08 unverdicted novelty 5.0

    An active-inference agent builds real-time topological maps and plans adaptive trajectories for exploration and goal-reaching in robotics without pre-training.