Intrinsic Successive Convexification: Trajectory Optimization on Smooth Manifolds
Authors:
- Spencer KraislerSKSpencer Kraisler
- Mehran MesbahiMMMehran Mesbahi
- Behcet AcikmeseBABehcet Acikmese
Preprint
Abstract
A fundamental issue at the core of trajectory optimization on smooth manifolds is handling the implicit manifold constraint within the dynamics. The conventional approach is to enforce the dynamic model as a constraint. However, we show this approach leads to significantly redundant operations, as well as being heavily dependent on the state space representation. Specifically, we propose an intrinsic successive convexification methodology for optimal control on smooth manifolds. This so-called iSCvx is then applied to a representative example involving attitude trajectory optimization for a spacecraft subject to non-convex constraints.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Output-Feedback Synthesis Orbit Geometry: Quotient Manifolds and LQG Direct Policy OptimizationIEEE Control Systems Letters, 2024
- Convex Optimization for Trajectory Generation: A Tutorial on Generating Dynamically Feasible Trajectories Reliably and EfficientlyIEEE Control Systems, 2022
- A Brief Introduction to Manifold OptimizationJournal of the Operations Research Society of China, 2020
- Simple Algorithms for Optimization on Riemannian Manifolds with ConstraintsApplied Mathematics & Optimization, 2019
- Intrinsic Formulation of KKT Conditions and Constraint Qualifications on Smooth ManifoldsSIAM Journal on Optimization, 2019
- Global rates of convergence for nonconvex optimization on manifoldsIMA Journal of Numerical Analysis, 2018
- Optimal Control on Lie Groups: The Projection Operator ApproachIEEE Transactions on Automatic Control, 2013
- Riemannian Consensus for Manifolds With Bounded CurvatureIEEE Transactions on Automatic Control, 2012
- Control Theory from the Geometric Viewpoint2004
- Optimization techniques on Riemannian manifolds1995