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
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.
Forward citations
Cited by 2 Pith papers
-
Learning Smooth SE(3) Trajectories under Left-Invariant Riemannian Metrics
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.
-
Max Entropy Moment Kalman Filter for Polynomial Systems with Arbitrary Noise
MEM-KF approximates the Bayes filter for polynomial systems by propagating moments and recovering max-entropy distributions, with point estimates extracted via semidefinite relaxation.
Discussion (0). Continue with ORCID to comment.