Optimal Control of Ascent Trajectory for Launch Vehicles: A Convex Approach

Abstract

This paper presents an online ascent trajectory optimization algorithm based on optimal control and convex optimization without accurate initial guesses. Due to the high complexity of space systems, exceptional cases such as engine failures may happen during the flight. In these cases, the dynamical model greatly changes and the nominal trajectory is infeasible. Thus, online trajectory optimization and replan should be considered when accurate initial guesses cannot be given. In this paper, the ascent trajectory optimization problem of launch vehicles is formulated as a Hamilton two-point boundary value problem (TPBVP) according to the optimal control theory. The control vector is expressed as a function of costate variables and the terminal condition is given according to the orbital constraint of the launch mission. In order to solve the TPBVP rapidly and accurately without accurate initial guesses, a convex approach is presented. Firstly, the flip-Radau pseudospectral method is applied to convert the continuous-time TPBVP into a finitedimensional equality constraint. Then, successive linearization is applied to formulate the problem as a series of iteratively solved second-order cone programming (SOCP) subproblems. Considering the accuracy and robustness of the algorithm, trust-region and relaxation strategy are applied. The convex trajectory optimization can be solved by Interior Point Method (IPM) automatically. Simulation results in the case of thrust loss are presented to show the accuracy, efficiency and robustness of the algorithm.

Multi-Process Integrated Planning and Guidance for Return of Reusable Aircraft Under Time Constraint

“…In the flight process, the control parameters are adjusted by the real-time estimated flight time by neural network, and the purpose of adjusting time is realized. In recent years, convex optimization algorithm has been widely applied to solve the online trajectory planning and guidance problem [25][26][27][28][29][30][31][32], which is also of referential significance to this study.…”

A Convex Approach for Trajectory Optimization of Super-Synchronous-Transfer-Orbit Large Launch Systems with Time-Position Constraints

“…For aerospace applications, lossless relaxation and convexification are always applied to convexify the thrust magnitude constraints [20]. Lossless convexification has been successfully applied to solve the optimization problem of landing vehicles [21], launch vehicles [20], missiles [22], etc. Successive convexification has a broader range of applications.…”

Online trajectory optimization and guidance algorithm for space interceptors with nonlinear terminal constraints via convex programming

“…Furthermore, with the development of space technology and the increasing demand for tasks, defense systems and missions become more complex and emergencies such as engine fault and target maneuver/mission change may happen during the flight. To meet the requirement of emergency handling, online autonomous trajectory planning and optimization has been developed these years, which means designing the flight trajectory and accomplishing the mission without crew intervention and ground support (Lu and Liu, 2013; Li et al , 2019). This technology has been widely applied to enhance interceptors’ survivability and mission capacity.…”