TY - GEN
T1 - Trajectory Optimization for the Vertical Landing Phase of Reusable Launch Vehicles Via Convex Approach
AU - Li, Yuan
AU - Shi, Linan
AU - Chen, Ping
AU - Wei, Changzhu
AU - Gao, Xing
N1 - Publisher Copyright:
© 2022, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
PY - 2022
Y1 - 2022
N2 - For better computational efficiency, this paper proposes a convex algorithm to solve the online trajectory optimization problem for the vertical powered landing flight phase of vehicles. To recycle the stages of launch vehicles and lower the cost, vertical take-off/vertical landing reusable launch vehicles are widely studied, actually the precision of the powered landing phase is very important for the recycling mission. In this paper, to achieve both the high precision of landing and the high efficiency of online computation, the convex optimization approach is applied to settle the trajectory optimization problem. Firstly, according to the dynamical model, constraints and mission requirements, the trajectory optimization problem of the vehicles is formulated. Secondly, the flip-Radau pseudospectral discretization approach, lossless convexification, and successive convexification technology are employed to convert the original nonconvex problem to a series of convex problems, and these subproblems can be solved by the primal-dual interior-point method (IPM) accurately and rapidly. The computational procedure of the IPM is also given in detail in this paper. Finally, numerical simulation experiments are given, which prove the computational efficiency and accuracy of the presented convex optimization method.
AB - For better computational efficiency, this paper proposes a convex algorithm to solve the online trajectory optimization problem for the vertical powered landing flight phase of vehicles. To recycle the stages of launch vehicles and lower the cost, vertical take-off/vertical landing reusable launch vehicles are widely studied, actually the precision of the powered landing phase is very important for the recycling mission. In this paper, to achieve both the high precision of landing and the high efficiency of online computation, the convex optimization approach is applied to settle the trajectory optimization problem. Firstly, according to the dynamical model, constraints and mission requirements, the trajectory optimization problem of the vehicles is formulated. Secondly, the flip-Radau pseudospectral discretization approach, lossless convexification, and successive convexification technology are employed to convert the original nonconvex problem to a series of convex problems, and these subproblems can be solved by the primal-dual interior-point method (IPM) accurately and rapidly. The computational procedure of the IPM is also given in detail in this paper. Finally, numerical simulation experiments are given, which prove the computational efficiency and accuracy of the presented convex optimization method.
KW - Convex optimization
KW - Convexification
KW - Primal-dual interior-point method
KW - Trajectory optimization
UR - https://www.scopus.com/pages/publications/85120608886
U2 - 10.1007/978-981-15-8155-7_434
DO - 10.1007/978-981-15-8155-7_434
M3 - 会议稿件
AN - SCOPUS:85120608886
SN - 9789811581540
T3 - Lecture Notes in Electrical Engineering
SP - 5265
EP - 5276
BT - Advances in Guidance, Navigation and Control - Proceedings of 2020 International Conference on Guidance, Navigation and Control, ICGNC 2020
A2 - Yan, Liang
A2 - Duan, Haibin
A2 - Yu, Xiang
PB - Springer Science and Business Media Deutschland GmbH
T2 - International Conference on Guidance, Navigation and Control, ICGNC 2020
Y2 - 23 October 2020 through 25 October 2020
ER -