arXiv:2606.24489cs.RO2026-06

提出一种去中心化姿态图优化框架,支持任意通信拓扑下的多机器人协同定位与物体位姿估计。

Decentralized Pose Graph Riemannian Optimization for Object-based Multi-Robot SLAM

论文配图:Decentralized Pose Graph Riemannian Optimization for Object-based Multi-Robot SLAM
图 1 · 摘自论文原文
  • 通过一致性机制解耦机器人与物体的联合估计问题,适应任意通信拓扑。
  • 采用分布式近似牛顿法,在SE(d)流形上利用局部二阶信息,降低迭代次数和通信开销。
  • 适用于通信不稳定的真实多机器人系统,兼具高精度、高效能与强鲁棒性。

姿态图优化(PGO)是网络化多机器人同时定位与地图构建(SLAM)中的关键后端组件。在基于物体的多机器人SLAM中,问题更加紧密耦合,因为机器人需共同估计自身轨迹及被多个传感器观测到的持久物体的位姿。现有去中心化方案通常假设通信图与物理交互拓扑高度一致,这在实际部署中受限于稀疏、间歇或时变通信。本文提出一种完全去中心化的基于物体的多机器人PGO黎曼优化框架,通过一致性机制解耦耦合估计问题,支持灵活的通信拓扑。为提升有限通信预算下的收敛性,进一步设计了一种分布式近似牛顿算法,直接在SE(d)流形上操作以保持几何一致性,并利用局部二阶信息;理论证明其收敛至黎曼一阶驻点,并通过条件数分析说明近似二阶信息相比一阶下降的优势。实验表明该方法显著减少迭代次数与通信开销,同时不损失估计精度。在公开基准、大规模仿真及真实多机器人实验中均验证了更高的准确性、运行效率、跨网络拓扑的可扩展性以及对通信故障的鲁棒性。

原文摘要 · Abstract (English)

Pose graph optimization (PGO) is a key back-end component for state estimation in networked multi-robot simultaneous localization and mapping (SLAM). In object-based multi-robot SLAM, the problem becomes more tightly coupled because robots must jointly estimate both their trajectories and the poses of persistent objects observed by multiple agents. Existing decentralized solutions often assume that the communication graph closely matches the physical interaction topology, which is restrictive in realistic deployments where communication is sparse, intermittent, or time-varying. This paper presents a fully decentralized Riemannian optimization framework for object-based multi-robot PGO that decouples the coupled estimation problem via a consensus mechanism, enabling flexible communication topologies. To improve convergence under limited communication budgets, we further develop a distributed approximate-Newton scheme that exploits local second-order information while operating directly on the SE(d) manifold to preserve geometric consistency, and we establish the convergence to Riemannian first-order stationary points and provide a local condition-number analysis explaining the benefit of approximate second-order information over first-order Riemannian descent. The resulting method reduces iteration count and communication overhead without sacrificing estimation accuracy. Extensive evaluations on public benchmarks, large-scale simulations, and real-world multi-robot experiments demonstrate improved accuracy, runtime efficiency, scalability across network topologies, and robustness to communication failures.

多机器人SLAM去中心化优化黎曼优化物体感知

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。