Successive Convexification for Online Ascent Trajectory Optimization

In this paper, a method based on the successive convexification is proposed to solve the ascent trajectory optimization problem, the algorithm converges to the optimal solution quickly even if the initial guess is coarse. A three-dimensional motion is formulated with complex aerodynamics and termina...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2021, Vol.9, p.141843-141860
Main Authors: Hu, Cheng, Bai, Xibin, Zhang, Shifeng, Yang, Huabo
Format: Article
Language:English
Subjects:
Aerodynamic coefficients
Aerodynamics
Algorithms
Ascent trajectories
ascent trajectory optimization
complex nonlinear aerodynamic force
Control stability
Convergence
Convex optimization
Iterative solution
online trajectory optimization
Optimal control
Optimization
Programming
Real-time systems
Rockets
Space missions
successive convexification
Terminal constraints
Three dimensional motion
Trajectory optimization
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, a method based on the successive convexification is proposed to solve the ascent trajectory optimization problem, the algorithm converges to the optimal solution quickly even if the initial guess is coarse. A three-dimensional motion is formulated with complex aerodynamics and terminal constraints. Based on the modified aerodynamic coefficients, the new auxiliary control variables are designed to deal with the complex aerodynamics and non-smooth of control variables in the discrete optimization problem. The inner nonconvex constraints between the new control are relaxed to be convex without loss. The artificial infeasibility and unboundedness caused by linearization are tackled by the virtual controls and soft constraint for trust region in the successive convexification. The good convergence of the proposed method is illustrated by the iterative solutions of the ascent trajectory optimization problem for a small guided rocket, the accuracy is verified by the comparison with the optimal solution given by the typical optimal control solvers, and the feasibility and stability are demonstrated by optimal solutions of the ascent trajectory optimization problems under different missions and dispersed conditions. These excellent performances validated by the adequate simulations indicate that the proposed algorithm can be implemented online.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2021.3120840