Direct LiDAR Odometry: Fast Localization With Dense Point Clouds
Open accessThe DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Abstract
Field robotics in perceptually-challenging environments require fast and accurate state estimation, but modern LiDAR sensors quickly overwhelm current odometry algorithms. To this end, this letter presents a lightweight frontend LiDAR odometry solution with consistent and accurate localization for computationally-limited robotic platforms. Our Direct LiDAR Odometry (DLO) method includes several key algorithmic innovations which prioritize computational efficiency and enables the use of dense, minimally-preprocessed point clouds to provide accurate pose estimates in real-time. This is achieved through a novel keyframing system which efficiently manages historical map information, in addition to a custom iterative closest point solver for fast point cloud registration with data structure recycling. Our method is more accurate with lower computational overhead than the current state-of-the-art and has been extensively evaluated in multiple perceptually-challenging environments on aerial and legged robots as part of NASA JPL Team CoSTAR’s research and development efforts for the DARPA Subterranean Challenge.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
3D is here: Point Cloud Library (PCL)
Rusu, R. B., & Cousins, S. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980567 · Cited by 4,885 · cited 2×
“7, we observed that NanoGICP converged faster on average (42.53ms) when compared to FastGICP (72.88ms) and PCL’s GICP (178.24ms).”
MethodPast, Present, and Future of Simultaneous Localization and Mapping: Toward the Robust-Perception Age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I., & Leonard, J. J. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2624754 · Cited by 3,596
LOAM: Lidar Odometry and Mapping in Real-time
Zhang, J., & Singh, S. (2014) · Robotics: Science and Systems X · doi:10.15607/rss.2014.x.007 · Cited by 3,303
Object modelling by registration of multiple range images
Chen, Y., & Medioni, G. (1992) · Image and Vision Computing · doi:10.1016/0262-8856(92)90066-c · Cited by 3,154
Past, present, and future of simultaneous localization and mapping: Toward the robust-perception age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I. D., & Leonard, J. J. (2016) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-138892 · Cited by 3,048
Lego-loam: Lightweight and ground-optimized lidar odometry and mapping on variable terrain
Shan, T., & Englot, B. (2018) · 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2018.8594299 · Cited by 2,295 · cited 3×
“Feature-based methods [2], [4]–[6] attempt to mitigate this by using only the most salient points, but these methods employ an often computationally-intensive feature extraction step and may accidentally discard data which could otherwise help improve the quality of downstream registration.”
BackgroundMethodInfluentialLIO-SAM: Tightly-coupled Lidar Inertial Odometry via Smoothing and Mapping
Shan, T., Englot, B., Meyers, D., Wang, W., Ratti, C., & Rus, D. (2020) · 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros45743.2020.9341176 · Cited by 2,199
Real-time loop closure in 2D LIDAR SLAM
Hess, W., Kohler, D., Rapp, H., & Andor, D. (2016) · 2016 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2016.7487258 · Cited by 1,938
FAST-LIO2: Fast Direct LiDAR-Inertial Odometry
Xu, W., Cai, Y., He, D., Lin, J., & Zhang, F. (2022) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3141876 · Cited by 1,750
Segal, A., Haehnel, D., & Thrun, S. (2009) · Robotics: Science and Systems V · doi:10.15607/rss.2009.v.021 · Cited by 1,526
FAST-LIO: A Fast, Robust LiDAR-Inertial Odometry Package by Tightly-Coupled Iterated Kalman Filter
Xu, W., & Zhang, F. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2021.3064227 · Cited by 1,127
Lvi-sam: Tightly-coupled lidar-visual-inertial odometry via smoothing and mapping
Shan, T., Englot, B., Ratti, C., & Rus, D. (2021) · 2021 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra48506.2021.9561996 · Cited by 624
Tightly Coupled 3D Lidar Inertial Odometry and Mapping
Ye, H., Chen, Y., & Liu, M. (2019) · 2019 International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2019.8793511 · Cited by 574
Survey of Nearest Neighbor Techniques
Bhatia, N., & Vandana (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1007.0085 · Cited by 447 · cited 1×
“Tree-based data structures have been shown to decrease this nearest-neighbor search cost significantly [7], but the extraction of a local submap still involves too many points after just a few keyframes, thus”
Background3DFeat-Net: Weakly Supervised Local 3D Features for Point Cloud Registration
Yew, Z. J., & Lee, G. H. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01267-0_37 · Cited by 392 · cited 1×
“com/vectr-ucla/direct lidar odometry [10] or learned networks [11] and might consist of planes [5], lines and edges [4], [6], or ground points [2].”
BackgroundVoxelized GICP for Fast and Accurate 3D Point Cloud Registration
Koide, K., Yokozuka, M., Oishi, S., & Banno, A. (2021) · 2021 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra48506.2021.9560835 · Cited by 386
Ebadi, K., Chang, Y., Palieri, M., Stephens, A., Hatteland, A., Heiden, E., Thakur, A., Funabiki, N., Morrell, B., Wood, S., et al. (2020) · 2020 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra40945.2020.9197082 · Cited by 182
Self-citationLOCUS: A Multi-Sensor Lidar-Centric Solution for High-Precision Odometry and 3D Mapping in Real-Time
Palieri, M., Morrell, B., Thakur, A., Ebadi, K., Nash, J., Chatterjee, A., Kanellakis, C., Carlone, L., Guaragnella, C., & Agha–mohammadi, A. (2020) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.3044864 · Cited by 168
Self-citation
Metadata
- Authors
- Chen, K., Lopez, B. T., Agha-mohammadi, A.-A., & Mehta, A.
- Venue
- IEEE Robotics and Automation Letters
- Published
- 2022-04
- Volume
- 7
- Issue
- 2
- Pages
- 2000-2007
- ISSN
- 2377-3766 (ISSN-L)
- 2377-3774
- OpenAlex
- W3201923677
- Cited by
- 231
- References
- 18
- FWCI
- 21.29
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.