Skip to content
AI News HubLIVE
Original source2 min read

Distributed Pose Graph Optimization via Continuous Riemannian Dynamics

Summary

A novel framework for distributed Pose Graph Optimization is introduced, formulating the problem as a second-order continuous-time dynamical system on Lie groups. By treating pose variables as massive particles with damping, equilibrium points match first-order critical points. The algorithm generalizes Riemannian gradient descent and Gauss-Newton. For multi-robot setups, a fully distributed parallel method using block-diagonal mass/damping matrices enables each robot to solve ODEs for its own poses with minimal communication. Modeling state and velocity allows principled neighbor prediction that improves convergence under delayed communication. Theoretical analysis provides sufficient conditions for energy dissipation. Experiments on benchmark datasets show superior performance over stat…

SourcearXiv RoboticsAuthor: Jaeho Shin, Maani Ghaffari, Yulun Tian
Distributed Pose Graph Optimization via Continuous Riemannian Dynamics
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[2605.11210] Distributed Pose Graph Optimization via Continuous Riemannian Dynamics

[Submitted on 11 May 2026]

Title:Distributed Pose Graph Optimization via Continuous Riemannian Dynamics

View a PDF of the paper titled Distributed Pose Graph Optimization via Continuous Riemannian Dynamics, by Jaeho Shin and 2 other authors

View PDF HTML (experimental)

Abstract:We present a framework for distributed Pose Graph Optimization (PGO) by formulating the problem as a second-order continuous-time dynamical system evolving on Lie groups. By modeling pose variables as massive particles subject to damping, the equilibrium points of the resulting Riemannian dynamics coincide with first-order critical points of the original PGO problem. Using the governing damped Euler--Poincaré equations and a semi-implicit geometric integrator, we design an optimization algorithm that generalizes existing algorithms such as Riemannian gradient descent and Gauss--Newton. In multi-robot settings, we present a fully distributed and parallel method based on block-diagonal mass and damping matrices, where each robot solves an ordinary differential equation for its own poses with minimal communication overhead. Moreover, modeling both state and velocity enables principled neighbor prediction that significantly improves convergence under delayed communication. Theoretically, we present an analysis and establish sufficient condition that ensures energy dissipation under the employed geometric discretization scheme. Experiments on benchmark PGO datasets demonstrate that the proposed solver achieves superior performance compared to state-of-the-art distributed baselines in both synchronous and asynchronous regimes.

Subjects:

Robotics (cs.RO)

Cite as: arXiv:2605.11210 [cs.RO]

(or arXiv:2605.11210v1 [cs.RO] for this version)

https://doi.org/10.48550/arXiv.2605.11210

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Jaeho Shin [view email] [v1] Mon, 11 May 2026 20:24:16 UTC (2,040 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Distributed Pose Graph Optimization via Continuous Riemannian Dynamics, by Jaeho Shin and 2 other authors

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.RO

new | recent | 2026-05

Change to browse by:

cs

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

EngineersAdvanced

Key points

  • Proposes a continuous Riemannian dynamics framework for distributed PGO, converting optimization into a second-order dynamical system.
  • Designs an optimization algorithm via damped Euler–Poincaré equations and a semi-implicit geometric integrator, unifying multiple existing methods.
  • Achieves fully distributed and parallel multi-robot solving with neighbor prediction to handle communication delays.
  • Demonstrates superior performance over current distributed baselines in both synchronous and asynchronous settings.

Highlights and analysis are generated automatically and may contain errors. Check the original source.