TY - JOUR
T1 - High-Accuracy Rocket Landing via Lossless Convexification
AU - Xiao, Wei
AU - Hong, Bei
AU - Liu, Junpeng
AU - Chang, Xiaofei
AU - Fu, Wenxing
N1 - Publisher Copyright:
© 2025 by the authors.
PY - 2025/11
Y1 - 2025/11
N2 - With the development of rocket technology, achieving high-precision landing has become a key technical challenge in the field of aerospace. To cope with this challenge, we propose a lossless convexification algorithm based on the integral pseudospectral method in this paper. Firstly, for the fuel optimization problem, the continuous dynamic equations and constraints are discretized with high accuracy using an integral-type pseudospectral method. By constructing a global integration matrix at Legendre–Gauss nodes, the original complex continuous problem is effectively transformed into a discrete form that is more tractable for numerical optimization. Secondly, the non-convex constraints are transformed using the lossless convexification technique, thereby reformulating the original problem as a second-order cone programming (SOCP) problem. The effectiveness of the proposed algorithm is validated through numerical simulations, which demonstrate high landing accuracy, robustness, and fuel efficiency. These results highlight the algorithm’s high performance and strong potential for practical application in space missions.
AB - With the development of rocket technology, achieving high-precision landing has become a key technical challenge in the field of aerospace. To cope with this challenge, we propose a lossless convexification algorithm based on the integral pseudospectral method in this paper. Firstly, for the fuel optimization problem, the continuous dynamic equations and constraints are discretized with high accuracy using an integral-type pseudospectral method. By constructing a global integration matrix at Legendre–Gauss nodes, the original complex continuous problem is effectively transformed into a discrete form that is more tractable for numerical optimization. Secondly, the non-convex constraints are transformed using the lossless convexification technique, thereby reformulating the original problem as a second-order cone programming (SOCP) problem. The effectiveness of the proposed algorithm is validated through numerical simulations, which demonstrate high landing accuracy, robustness, and fuel efficiency. These results highlight the algorithm’s high performance and strong potential for practical application in space missions.
KW - integral pseudospectral method
KW - lossless convex optimization
KW - rocket precision landing
KW - trajectory optimization
UR - https://www.scopus.com/pages/publications/105023666760
U2 - 10.3390/aerospace12111009
DO - 10.3390/aerospace12111009
M3 - 文章
AN - SCOPUS:105023666760
SN - 2226-4310
VL - 12
JO - Aerospace
JF - Aerospace
IS - 11
M1 - 1009
ER -