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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.RO 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
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.