Loop Closure via Maximal Cliques in 3D LiDAR-Based SLAM
arXiv:2603.05397 · doi:10.1109/ECMR65884.2025.11163179
Abstract
Reliable loop closure detection remains a critical challenge in 3D LiDAR-based SLAM, especially under sensor noise, environmental ambiguity, and viewpoint variation conditions. RANSAC is often used in the context of loop closures for geometric model fitting in the presence of outliers. However, this approach may fail, leading to map inconsistency. We introduce a novel deterministic algorithm, CliReg, for loop closure validation that replaces RANSAC verification with a maximal clique search over a compatibility graph of feature correspondences. This formulation avoids random sampling and increases robustness in the presence of noise and outliers. We integrated our approach into a real- time pipeline employing binary 3D descriptors and a Hamming distance embedding binary search tree-based matching. We evaluated it on multiple real-world datasets featuring diverse LiDAR sensors. The results demonstrate that our proposed technique consistently achieves a lower pose error and more reliable loop closures than RANSAC, especially in sparse or ambiguous conditions. Additional experiments on 2D projection-based maps confirm its generality across spatial domains, making our approach a robust and efficient alternative for loop closure detection.
Accepted in the 2025 European Conference on Mobile Robots (ECMR). This is the author's version of the work
References in corpus (6)
- Go-ICP: A Globally Optimal Solution to 3D ICP Point-Set Registration
- KISS-ICP: In Defense of Point-to-Point ICP -- Simple, Accurate, and Robust Registration If Done the Right Way
- SegMatch: Segment based loop-closure for 3D point clouds
- HBST: A Hamming Distance embedding Binary Search Tree for Visual Place Recognition
- Contour Context: Abstract Structural Distribution for 3D LiDAR Loop Detection and Metric Pose Estimation
- A flexible framework for accurate LiDAR odometry, map manipulation, and localization