Metraipolis › archive › dc_235c715de855
HP2-SLAM: Adaptive Hybrid ICP for Robust and Efficient LiDAR SLAM — arXiv:2608.14996
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.14996
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T23:03:26.686Z
- SHA-256 of the archived text
f196fac6deafa224fe50fa600a9af3b7ed657d08a9138487dbfaaa1797c04a79- Stable URL of this page
https://metraipolis.com/documento/dc_235c715de855
How to cite
HP2-SLAM: Adaptive Hybrid ICP for Robust and Efficient LiDAR SLAM — arXiv:2608.14996 — arXiv (en), https://arxiv.org/abs/2608.14996 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_235c715de855 (Metraipolis archive dc_235c715de855, sha256 f196fac6deafa224fe50fa600a9af3b7ed657d08a9138487dbfaaa1797c04a79)
BibTeX
@misc{dc235c715de855,
title = {HP2-SLAM: Adaptive Hybrid ICP for Robust and Efficient LiDAR SLAM — arXiv:2608.14996},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.14996},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_235c715de855; sha256 f196fac6deafa224fe50fa600a9af3b7ed657d08a9138487dbfaaa1797c04a79},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.14996. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Achieving robustness, accuracy, and efficiency simultaneously remains a central challenge in light detection and ranging (LiDAR) simultaneous localization and mapping (SLAM). While learning-based approaches deliver strong benchmark performance, they often require extensive training, substantial computational resources, and struggle to generalize to unseen or degenerate environments. Geometry-based methods are efficient and interpretable, yet their performance degrades in planar or repetitive scenes due to limitations of standard iterative closest point (ICP) formulations. We present HP2-SLAM, a minimalist yet robust LiDAR SLAM framework built around a neighborhood-size adaptive hybrid ICP. Our key insight is a planarity-aware adaptive threshold that dynamically classifies correspondences based on local geometric structure and density, thereby enabling a principled balance between point-to-plane and point-to-point residuals. This formulation stabilizes alignment in both structured and degenerate environments without feature engineering, learning modules, or dataset-specific tuning. Integrated into a complete SLAM pipeline with submap management, loop closure detection, and pose graph optimization, HP2-SLAM consistently outperforms strong geometry-based baselines across publicly available datasets while maintaining real-time performance on commodity hardware. Our results demonstrate that carefully designed geometric adaptation can achieve strong generalization and robustness without sacrificing simplicity or efficiency. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-18 in cs.RO). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2608.14996 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T23:01:50.341Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).