Pith. sign in

REVIEW 2 cited by

Riemannian Direct Trajectory Optimization of Rigid Bodies on Matrix Lie Groups

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2505.02323 v1 pith:DHD4TTKV submitted 2025-05-05 cs.RO cs.SYeess.SY

classification cs.ROcs.SYeess.SY
keywords optimizationrigidriemanniantrajectorybodiesdirectdynamicsgroup
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Designing dynamically feasible trajectories for rigid bodies is a fundamental problem in robotics. Although direct trajectory optimization is widely applied to solve this problem, inappropriate parameterizations of rigid body dynamics often result in slow convergence and violations of the intrinsic topological structure of the rotation group. This paper introduces a Riemannian optimization framework for direct trajectory optimization of rigid bodies. We first use the Lie Group Variational Integrator to formulate the discrete rigid body dynamics on matrix Lie groups. We then derive the closed-form first- and second-order Riemannian derivatives of the dynamics. Finally, this work applies a line-search Riemannian Interior Point Method (RIPM) to perform trajectory optimization with general nonlinear constraints. As the optimization is performed on matrix Lie groups, it is correct-by-construction to respect the topological structure of the rotation group and be free of singularities. The paper demonstrates that both the derivative evaluations and Newton steps required to solve the RIPM exhibit linear complexity with respect to the planning horizon and system degrees of freedom. Simulation results illustrate that the proposed method is faster than conventional methods by an order of magnitude in challenging robotics tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning Smooth SE(3) Trajectories under Left-Invariant Riemannian Metrics

    cs.RO 2026-08 conditional novelty 6.0 of 10

    A metric-conditioned network with analytic boundary completion generates smooth SE(3) trajectories in about a millisecond, approximating variational optima under left-invariant Riemannian metrics.

  2. Max Entropy Moment Kalman Filter for Polynomial Systems with Arbitrary Noise

    cs.RO 2025-06 conditional novelty 6.0 of 10

    MEM-KF approximates the Bayes filter for polynomial systems by propagating moments and recovering max-entropy distributions, with point estimates extracted via semidefinite relaxation.

Pith tools