Pose graph optimization is recast as damped Riemannian dynamics on Lie groups, enabling a fully distributed algorithm with a semi-implicit integrator that converges under both synchronous and asynchronous communication.
DDF - SAM 2.0: Consistent distributed smoothing and mapping
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.RO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Decentralized Riemannian optimization framework for object-based multi-robot pose graph optimization using consensus and approximate-Newton methods to reduce communication overhead while maintaining accuracy.
citing papers explorer
-
Distributed Pose Graph Optimization via Continuous Riemannian Dynamics
Pose graph optimization is recast as damped Riemannian dynamics on Lie groups, enabling a fully distributed algorithm with a semi-implicit integrator that converges under both synchronous and asynchronous communication.
-
Decentralized Pose Graph Riemannian Optimization for Object-based Multi-Robot SLAM
Decentralized Riemannian optimization framework for object-based multi-robot pose graph optimization using consensus and approximate-Newton methods to reduce communication overhead while maintaining accuracy.