Successive Convexification of Non-Convex Optimal Control Problems and Its Convergence Properties

Abstract

This paper presents an algorithm to solve non-convex optimal control problems, where non-convexity can arise from nonlinear dynamics, and non-convex state and control constraints. This paper assumes that the state and control constraints are already convex or convexified, the proposed algorithm convexifies the nonlinear dynamics, via a linearization, in a successive manner. Thus at each succession, a convex optimal control subproblem is solved. Since the dynamics are linearized and other constraints are convex, after a discretization, the subproblem can be expressed as a finite dimensional convex programming subproblem. Since convex optimization problems can be solved very efficiently, especially with custom solvers, this subproblem can be solved in time-critical applications, such as real-time path planning for autonomous vehicles. Several safe-guarding techniques are incorporated into the algorithm, namely virtual control and trust regions, which add another layer of algorithmic robustness. A convergence analysis is presented in continuous- time setting. By doing so, our convergence results will be independent from any numerical schemes used for discretization. Numerical simulations are performed for an illustrative trajectory optimization example.

Updates: corrected wordings for LICQ. This is the full version. A brief version of this paper is published in 2016 IEEE 55th Conference on Decision and Control (CDC). http://ieeexplore.ieee.org/document/7798816/

References in corpus (1)

• Successive Convexification of Non-Convex Optimal Control Problems and Its Convergence Properties

Cited by in corpus (8)

• Successive Convexification of Non-Convex Optimal Control Problems and Its Convergence Properties
• Successive Convexification for 6-DoF Mars Rocket Powered Landing with Free-Final-Time
• Successive Convexification of Non-Convex Optimal Control Problems with State Constraints
• Contact-Implicit Trajectory Optimization Based on a Variable Smooth Contact Model and Successive Convexification
• Autonomous parafoil precision landing using convex real-time optimized guidance and control
• Successive Convexification with Feasibility Guarantee via Augmented Lagrangian for Non-Convex Optimal Control Problems
• Solar-Sail Deep Space Trajectory Optimization Using Successive Convex Programming
• Optimal Science-time Reorientation Policy for the Comet Interceptor Flyby via Sequential Convex Programming