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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
method 1
citation-polarity summary
fields
cs.RO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A LiDAR-inertial odometry pipeline supplies deterministic feasible sets as protection levels by linking ICP point-cloud noise to pose uncertainty via a closed-form relation and propagating it with an on-manifold ellipsoidal set-membership filter.
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.
-
Safety-Critical LiDAR-Inertial Odometry with On-Manifold Deterministic Protection Level
A LiDAR-inertial odometry pipeline supplies deterministic feasible sets as protection levels by linking ICP point-cloud noise to pose uncertainty via a closed-form relation and propagating it with an on-manifold ellipsoidal set-membership filter.