To solve the non-convex ascent trajectory optimization problem with non-convex dynamic equations and constraints, a convex optimization method is proposed in this paper. The ascent trajectory optimization problem is formulated by giving the ascent dynamic equations and analyzing constraint conditions, which is discretized into a nonlinear programming problem by trapezoidal integration. Then convex methods are researched on discrete constraints and dynamic equations, and an iterative algorithm is proposed based on narrowing trust region constraint. Simulation result proves that the method is faster and more accurate than the pseudo spectral method, and its low requirement of initial value and suitability for the change of terminal state in large range highly improve the efficiency of the ascent optimization.
Convex Method for Ascent Trajectory Optimization Using Iterative Narrowing Trust Region
2018-08-01
149142 byte
Conference paper
Electronic Resource
English
Rapid ascent trajectory optimization for guided rockets via sequential convex programming
SAGE Publications | 2019
|Ascent Trajectory Optimization Using Genetic Algorithm
AIAA | 2009
|Trajectory optimization by steepest ascent method
NTRS | 1967
|