Environment-Adaptive Solid-State LiDAR-Inertial Odometry

• URL: http://arxiv.org/abs/2604.15864v1
• Date: Fri, 17 Apr 2026 09:13:52 GMT
• Title: Environment-Adaptive Solid-State LiDAR-Inertial Odometry
• Abstract summary: Solid-state LiDAR-inertial SLAM has attracted significant attention due to its advantages in speed and robustness.<n> achieving accurate mapping in extreme environments remains challenging due to severe geometric degeneracy and unreliable observations.<n>We propose an environment-adaptive solid-state LiDAR-inertial odometry that integrates local normal-vector constraints with degeneracy-aware map maintenance.
• Score: 4.423149595363559
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Solid-state LiDAR-inertial SLAM has attracted significant attention due to its advantages in speed and robustness. However, achieving accurate mapping in extreme environments remains challenging due to severe geometric degeneracy and unreliable observations, which often lead to ill-conditioned optimization and map inconsistencies. To address these challenges, we propose an environment-adaptive solid-state LiDAR-inertial odometry that integrates local normal-vector constraints with degeneracy-aware map maintenance to enhance localization accuracy. Specifically, we introduce local normal-vector constraints to improve the stability of state estimation, effectively suppressing localization drift in degenerate scenarios. Furthermore, we design a degeneration-guided map update strategy to improve map precision. Benefiting from the refined map representation, localization accuracy is further enhanced in subsequent estimation. Experimental results demonstrate that the proposed method achieves superior mapping accuracy and robustness in extreme and perceptually degraded environments, with an average RMSE reduction of up to 12.8% compared to the baseline method.

Related papers

• Clipping Bottleneck: Stabilizing RLVR via Stochastic Recovery of Near-Boundary Signals [83.0127582612634]
  Near-boundary Rescue (NSR) is a minimal, plug-and-play modification that retains out-of-bound tokens to recover lost signals.<n>NSR substantially improves training stability and delivers consistent gains over strong baselines such as DAPO and GSPO.
  arXiv  Detail & Related papers  (2026-05-21T16:45:31Z)
• ViCrop-Det: Spatial Attention Entropy Guided Cropping for Training-Free Small-Object Detection [6.1221124436192875]
  ViCrop-Det is a training-free inference framework that introduces adaptive spatial trust region shrinkage.<n>We show that ViCrop-Det consistently adds +1-3 mAP@50 to RT-DETR-R50 and Deformable DETR with a marginal 20-23% latency overhead.<n>Under compute-matched settings, our adaptive routing strategy comprehensively surpasses uniform slicing baselines, achieving a highly optimized accuracy-speed trade-off.
  arXiv  Detail & Related papers  (2026-04-29T15:35:03Z)
• Uncertainty Estimation for Deep Reconstruction in Actuatic Disaster Scenarios with Autonomous Vehicles [68.82821445619759]
  principled uncertainty quantification is critical for active sensing strategies.<n>Evidential Deep Learning achieves the best reconstruction accuracy and uncertainty calibration across all sensor configurations.<n>These findings support Evidential Deep Learning as the preferred method for uncertainty-aware field reconstruction in real-time autonomous vehicle deployments.
  arXiv  Detail & Related papers  (2026-04-07T19:17:44Z)
• Variable-Resolution Virtual Maps for Autonomous Exploration with Unmanned Surface Vehicles (USVs) [12.687661957286416]
  In near-shore waters, autonomous surface vehicles (USVs) need reliable localisation and consistent mapping over extended areas.<n>Virtual map-based methods explicitly model localisation and mapping uncertainty by tightly coupling factor-graph SLAM with a map uncertainty criterion.<n>We propose a Variable-Resolution Virtual Map (VRVM), a computationally efficient method for representing map uncertainty.
  arXiv  Detail & Related papers  (2026-03-24T00:38:29Z)
• Geometry-Aware Uncertainty Quantification via Conformal Prediction on Manifolds [3.2848713528308817]
  We propose a framework that replaces Euclidean residuals with geodesic nonconformity scores and normalizes them by a cross-validated difficulty estimator to handle heteroscedastic noise.<n>The resulting prediction regions, geodesic caps on the sphere, have position-independent area and adapt their size to local prediction difficulty, yielding substantially more uniform conditional coverage than non-adaptive alternatives.
  arXiv  Detail & Related papers  (2026-02-17T21:12:47Z)
• AI-Augmented Density-Driven Optimal Control (D2OC) for Decentralized Environmental Mapping [0.0]
  This paper presents an AI-augmented decentralized framework for multi-agent (multi-robot) environmental mapping under limited sensing and communication.<n>The proposed method introduces an adaptive and self-correcting mechanism that enables agents to iteratively refine local density estimates.
  arXiv  Detail & Related papers  (2026-01-28T23:55:02Z)
• Ridge Estimation-Based Vision and Laser Ranging Fusion Localization Method for UAVs [17.481698143413862]
  This paper proposes a fusion localization method based on ridge estimation.<n>The column vectors of the design matrix have serious multicollinearity when using the least squares estimation algorithm.<n>Ridge estimation is introduced to mitigate the serious multicollinearity under the condition of limited observation.
  arXiv  Detail & Related papers  (2025-12-18T08:54:24Z)
• Revisiting Zeroth-Order Optimization: Minimum-Variance Two-Point Estimators and Directionally Aligned Perturbations [57.179679246370114]
  We identify the distribution of random perturbations that minimizes the estimator's variance as the perturbation stepsize tends to zero.<n>Our findings reveal that such desired perturbations can align directionally with the true gradient, instead of maintaining a fixed length.
  arXiv  Detail & Related papers  (2025-10-22T19:06:39Z)
• On the Optimal Construction of Unbiased Gradient Estimators for Zeroth-Order Optimization [57.179679246370114]
  A potential limitation of existing methods is the bias inherent in most perturbation estimators unless a stepsize is proposed.<n>We propose a novel family of unbiased gradient scaling estimators that eliminate bias while maintaining favorable construction.
  arXiv  Detail & Related papers  (2025-10-22T18:25:43Z)
• Towards Robust LiDAR Localization: Deep Learning-based Uncertainty Estimation [1.9268905951820923]
  Iterative Closest Point (ICP) is prone to errors in featureless environments and dynamic scenes, leading to inaccurate pose estimation.<n>We propose a data-driven framework that leverages deep learning to estimate the registration error covariance of ICP before matching.<n>Our method enables seamless integration of ICP within Kalman filtering, enhancing localization accuracy and robustness.
  arXiv  Detail & Related papers  (2025-09-23T13:02:44Z)
• Improving Gaussian Splatting with Localized Points Management [52.009874685460694]
  Localized Point Management (LPM) is capable of identifying those error-contributing zones in greatest need for both point addition and geometry calibration.<n>LPM applies point densification in the identified zones and then reset the opacity of the points in front of these regions, creating a new opportunity to correct poorly conditioned points.<n> Notably, LPM improves both static 3DGS and dynamic SpaceTimeGS to achieve state-of-the-art rendering quality while retaining real-time speeds.
  arXiv  Detail & Related papers  (2024-06-06T16:55:07Z)
• SPARE: Symmetrized Point-to-Plane Distance for Robust Non-Rigid 3D Registration [77.13381026159111]
  We propose SPARE, a novel formulation that utilizes a symmetrized point-to-plane distance for robust non-rigid registration.<n>The proposed method greatly improves the accuracy of non-rigid registration problems and maintains relatively high solution efficiency.
  arXiv  Detail & Related papers  (2024-05-30T15:55:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.