Continuous-time successive convexification for constrained trajectory optimization

We present continuous-time successive convexification (ct- scvx ), a real-time-capable solution method for constrained trajectory optimization, with continuous-time constraint satisfaction and guaranteed convergence. The proposed solution framework only relies on first-order information, and it comb...

Full description

Saved in:
Bibliographic Details
Published in:Automatica (Oxford) Vol. 180; p. 112464
Main Authors: Elango, Purnanand, Luo, Dayou, Kamath, Abhinav G., Uzun, Samet, Kim, Taewan, Açıkmeşe, Behçet
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.10.2025
Subjects:
Continuous-time constraint satisfaction
Optimal control
Sequential convex programming
Trajectory optimization
Sequential convex programming
Continuous-time constraint satisfaction
Optimal control
Trajectory optimization
ISSN:0005-1098
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present continuous-time successive convexification (ct- scvx ), a real-time-capable solution method for constrained trajectory optimization, with continuous-time constraint satisfaction and guaranteed convergence. The proposed solution framework only relies on first-order information, and it combines several key methods to solve a large class of nonlinear optimal control problems: (i) exterior penalty-based reformulation of the path constraints; (ii) generalized time-dilation; (iii) multiple-shooting discretization; (iv) ℓ1-exact penalization of the nonconvex constraints; and (v) the prox-linear method, a sequential convex programming (SCP) algorithm for convex-composite minimization. The proposed reformulation of the path constraints enables continuous-time constraint satisfaction even on sparse temporal discretization grids and obviates the need for mesh-refinement heuristics. Through the prox-linear method, we guarantee that: (i) ct-scvx converges to stationary points of the penalized problem; (ii) the converged stationary points that are feasible for the discretized and control-parameterized optimal control problem are also Karush–Kuhn–Tucker (KKT) points. Furthermore, we specialize this property to global minimizers of convex optimal control problems and obtain stronger convergence results by exploiting convexity. In addition to theoretical analysis, we demonstrate the effectiveness and real-time performance of ct-scvx by means of numerical examples from real-world optimal control applications: dynamic obstacle avoidance, and 3-degree-of-freedom (3-DoF) and 6-DoF autonomous rocket landing.
ISSN:0005-1098
DOI:10.1016/j.automatica.2025.112464