High-Dimensional Merit-Function-Based Sequential Convex Programming for Nonlinear Trajectory Optimization
Journal of Guidance, Control, and Dynamics · 2025-07 · 48 (7) · 1525-1544
DOI: 10.2514/1.g009022 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Guidance, Control, and Dynamics, 2025-07. Verfasst von Lei Xie und 4 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 52 Literaturangaben. Gefördert von: the Youth Fund of National Natural Science Foundation of China, the Major Research Plan of the National Natural Science Foundation of China.
Abstract (Originalsprache)
This study focuses on the key challenge of achieving high-precision guidance for spacecraft: real-time trajectory optimization. The highly efficient sequential convex programming (SCP) is a potential method to address this issue, but its convergence is difficult to guarantee. To enhance the convergence performance of SCP, this paper proposes a high-dimensional merit-function-based SCP method. The main contribution of this paper is threefold. Firstly, the traditional one-dimensional penalty function used to ensure the convergence of SCP is extended to a high-dimensional merit function, which avoids using the penalty parameter that is difficult to determine in advance. Secondly, to match the high-dimensional merit function, a feasibility-then-optimality convergence strategy is proposed, which is essentially an application of the iterative direction descent property in higher dimensions. Finally, based on the high-dimensional merit function and the feasibility-then-optimality strategy, an iterative algorithm is developed, and its convergence analysis is provided under certain assumptions. In numerical simulations, the effectiveness and robustness of the proposed algorithm are validated using the reentry trajectory optimization problem of a lunar capsule.
Förderung
- the Youth Fund of National Natural Science Foundation of China
- the Major Research Plan of the National Natural Science Foundation of China
Zitieren
APA
Xie, L., Zhou, X., Zhang, H., Tang, G., & Li, S. (2025). High-Dimensional Merit-Function-Based Sequential Convex Programming for Nonlinear Trajectory Optimization. Journal of Guidance, Control, and Dynamics, 48(7), 1525-1544. https://doi.org/10.2514/1.g009022
Vancouver
Xie L, Zhou X, Zhang H, Tang G, Li S. High-Dimensional Merit-Function-Based Sequential Convex Programming for Nonlinear Trajectory Optimization. Journal of Guidance, Control, and Dynamics. 2025;48(7):1525-1544. doi:10.2514/1.g009022
BibTeX
@article{Xie2025,
author = {Xie, Lei and Zhou, Xiang and Zhang, Hong-Bo and Tang, Guo-Jian and Li, Shuang},
title = {High-Dimensional Merit-Function-Based Sequential Convex Programming for Nonlinear Trajectory Optimization},
journal = {Journal of Guidance, Control, and Dynamics},
year = {2025},
volume = {48},
number = {7},
pages = {1525--1544},
doi = {10.2514/1.g009022}
}
EUVIMED