.png){kind=icon}
Return
Improved sequential convex programming using modified Chebyshev-Picard iteration for ascent trajectory optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ast.2021.107234.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an improved sequential convex programming (SCP) algorithm for ascent trajectory optimization of launch vehicles, by exploiting the state-of-the-art modified Chebyshev-Picard iteration (MCPI) technique. In the proposed algorithm, the MCPI technique is first utilized to transcribe the continuous-time optimization problem into a sequence of finite-dimensional subproblems. The lossless and successive convexification techniques are then employed to deal with the nonconvexity in optimization. The resulting convex subproblems can be reliably and efficiently solved via a primal-dual interior-point method solver. Numerical simulations for a minimum-time ascent trajectory optimization problem are conducted and the results show that the proposed algorithm has significant improvements over the standard SCP (which uses the Euler or trapezoidal rule for discretization), pseudospectral SCP, and GPOPS. (C) 2021 Elsevier Masson SAS. All rights reserved.
Keywords:
Launch vehicle
Trajectory optimization
Sequential convex programming
Modified Chebyshev-Picard iteration
Journal
IF:
5.8
Papers:
1.0W
Citations:
3.0W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSave
View more