A Decentralized LiDAR-SLAM System with Certifiably Optimal Pose Graph Optimization

• URL: http://arxiv.org/abs/2605.25051v2
• Date: Tue, 02 Jun 2026 08:02:33 GMT
• Title: A Decentralized LiDAR-SLAM System with Certifiably Optimal Pose Graph Optimization
• Abstract summary: This paper presents the first decentralized LiDAR-SLAM system that integrates a state-of-the-art certifiably optimal Pose Graph Optimization (PGO) backend.<n>We show that the proposed framework achieves superior robustness, improving trajectory RMSE by up to 48.9% compared to the state-of-the-arto-SLAM.
• Score: 9.471365552299678
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Decentralized multi-robot LiDAR-SLAM is essential for collaborative missions but faces significant challenges in maintaining global consistency. Existing frameworks predominantly rely on local-search optimization or one-time coordinate alignment, which are prone to suboptimal convergence and long-term inconsistency, especially in large-scale or degenerate environments. To address these limitations, this paper presents the first decentralized LiDAR-SLAM system that integrates a state-of-the-art certifiably optimal Pose Graph Optimization (PGO) backend. By leveraging the Riemannian Block Coordinate Descent (RBCD) algorithm, our system ensures globally consistent trajectory estimation without requiring accurate initial guesses. Experimental results demonstrate that the proposed framework achieves superior robustness, improving trajectory RMSE by up to 48.9% compared to the state-of-the-art DiSCo-SLAM.

Related papers

• Reinforcement Learning-Guided Evolutionary Policy Optimization for Preference-Adjustable Heterogeneous Agile Earth Observation Satellite Scheduling [50.176885352114674]
  Heterogeneous agile Earth observation satellite (AEOS) scheduling requires task selection, satellite assignment, and observation sequencing.<n>This paper proposes an evolutionary policy optimization framework for heterogeneous AEOS scheduling with preference-adjustable weighted objectives.
  arXiv  Detail & Related papers  (2026-08-25T12:16:28Z)
• Learning to Act and Cooperate for Distributed Black-Box Consensus Optimization [4.633828400918887]
  Distributed blackbox consensus optimization is a fundamental problem in multi-agent systems.<n>We propose a phased cognitive scheduling strategy to activate a resource adaptive cooperation framework.
  arXiv  Detail & Related papers  (2026-05-01T14:30:38Z)
• HAD: Combining Hierarchical Diffusion with Metric-Decoupled RL for End-to-End Driving [51.268878540511054]
  We propose HAD, an end-to-end planning framework with a Hierarchical Diffusion Policy.<n>We show that HAD achieves new state-of-the-art performance on both NAVSIM and HUGSIM.
  arXiv  Detail & Related papers  (2026-04-04T04:12:47Z)
• Taming the Instability: A Robust Second-Order Optimizer for Federated Learning over Non-IID Data [77.19117648492104]
  We present Federated Robust Curvature Optimization (FedRCO), a novel second-order optimization framework designed to improve convergence speed and reduce communication cost.<n>FedRCO addresses these challenges by integrating an efficient approximate curvature with a provable stability mechanism.<n>We show that FedRCO achieves superior robustness against diverse non-IID scenarios while achieving higher accuracy and faster convergence than both state-of-the-art first-order and second-order methods.
  arXiv  Detail & Related papers  (2026-03-30T11:37:46Z)
• Decentralized Spatial Reuse Optimization in Wi-Fi: An Internal Regret Minimization Approach [40.02689778290504]
  This paper introduces a decentralized learning algorithm based on regret-matching.<n>Internal regret minimization guides competing agents toward Correlated Equilibria (CE), effectively mimicking coordination without explicit communication.<n>Results confirm the not-yet-unleashed potential of scalable decentralized solutions.
  arXiv  Detail & Related papers  (2026-02-09T10:10:18Z)
• 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)
• SALPA: Spaceborne LiDAR Point Adjustment for Enhanced GEDI Footprint Geolocation [0.052498055901649014]
  Geo geolocation uncertainties undermine forest profile estimates, including carbon stock assessments.<n>We present SALPA, a multi-algorithm optimization framework integrating three optimization paradigms with five distance metrics.<n> validation across contrasting sites: topographically complex Nikko, Japan, and flat Landes, France.
  arXiv  Detail & Related papers  (2025-11-18T03:05:30Z)
• Stability and Generalization for Distributed SGDA [70.97400503482353]
  We propose the stability-based generalization analytical framework for Distributed-SGDA. We conduct a comprehensive analysis of stability error, generalization gap, and population risk across different metrics. Our theoretical results reveal the trade-off between the generalization gap and optimization error.
  arXiv  Detail & Related papers  (2024-11-14T11:16:32Z)
• On the Effective Usage of Priors in RSS-based Localization [56.68864078417909]
  We propose a Received Signal Strength (RSS) fingerprint and convolutional neural network-based algorithm, LocUNet. In this paper, we study the localization problem in dense urban settings. We first recognize LocUNet's ability to learn the underlying prior distribution of the Rx position or Rx and transmitter (Tx) association preferences from the training data, and attribute its high performance to these.
  arXiv  Detail & Related papers  (2022-11-28T00:31:02Z)
• Momentum Contrastive Autoencoder: Using Contrastive Learning for Latent Space Distribution Matching in WAE [51.09507030387935]
  Wasserstein autoencoder (WAE) shows that matching two distributions is equivalent to minimizing a simple autoencoder (AE) loss under the constraint that the latent space of this AE matches a pre-specified prior distribution. We propose to use the contrastive learning framework that has been shown to be effective for self-supervised representation learning, as a means to resolve this problem. We show that using the contrastive learning framework to optimize the WAE loss achieves faster convergence and more stable optimization compared with existing popular algorithms for WAE.
  arXiv  Detail & Related papers  (2021-10-19T22:55:47Z)
• Pushing the Envelope of Rotation Averaging for Visual SLAM [69.7375052440794]
  We propose a novel optimization backbone for visual SLAM systems. We leverage averaging to improve the accuracy, efficiency and robustness of conventional monocular SLAM systems. Our approach can exhibit up to 10x faster with comparable accuracy against the state-art on public benchmarks.
  arXiv  Detail & Related papers  (2020-11-02T18:02:26Z)

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.