The reviewed record of science sign in
Pith

arxiv: 2406.07371 · v1 · pith:6HMUAXQ5 · submitted 2024-06-11 · cs.RO

iMESA: Incremental Distributed Optimization for Collaborative Simultaneous Localization and Mapping

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:6HMUAXQ5record.jsonopen to challenge →

classification cs.RO
keywords c-slamdistributedimesaincrementalalgorithmback-endcollaborativecommunication
0
0 comments X
read the original abstract

This paper introduces a novel incremental distributed back-end algorithm for Collaborative Simultaneous Localization and Mapping (C-SLAM). For real-world deployments, robotic teams require algorithms to compute a consistent state estimate accurately, within online runtime constraints, and with potentially limited communication. Existing centralized, decentralized, and distributed approaches to solving C-SLAM problems struggle to achieve all of these goals. To address this capability gap, we present Incremental Manifold Edge-based Separable ADMM (iMESA) a fully distributed C-SLAM back-end algorithm that can provide a multi-robot team with accurate state estimates in real-time with only sparse pair-wise communication between robots. Extensive evaluation on real and synthetic data demonstrates that iMESA is able to outperform comparable state-of-the-art C-SLAM back-ends.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.