Improved sequential convex programming based on pseudospectral discretization for entry trajectory optimization

•The improved sequential convex programming algorithm was established based on the pseudospectral discretization technique.•The combined use of trust region strategy and regularisation technique substantially improves the solution efficiency of the algorithm.•The proposed algorithm requires only 5 %...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Aerospace science and technology Ročník 152; s. 109349
Hlavní autoři: Ma, Shoudong, Yang, Yuxin, Tong, Zheyu, Yang, Hua, Wu, Changju, Chen, Weifang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Masson SAS 01.09.2024
Témata:
Entry
Optimization efficiency
Sequential convex programming
Trajectory optimization
Optimization efficiency
Sequential convex programming
Entry
Trajectory optimization
ISSN:1270-9638
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•The improved sequential convex programming algorithm was established based on the pseudospectral discretization technique.•The combined use of trust region strategy and regularisation technique substantially improves the solution efficiency of the algorithm.•The proposed algorithm requires only 5 % of the GPOPS in CPU time when solving the general entry trajectory optimization problem. Sequential convex programming (SCP) is widely used to solve entry trajectory optimization problems. However, challenges persist in scenarios with strict constraints, such as unsolvable convex subproblems, iterative solution oscillations, and slow convergence rates. This study introduces an enhanced SCP algorithm designed to address these limitations. First, hp Radau pseudospectral discretization is used instead of trapezoidal discretization to improve the efficiency in solving subproblems while maintaining discretization accuracy. Second, the trust region is adaptively updated on the basis of trajectory information during iterations. Additionally, constraint relaxation and virtual control are introduced to facilitate smooth iteration at the initial stage. The regularization technique is also utilized to improve the convergence rates. Finally, the proposed algorithm is validated through two examples: maximum-terminal-velocity entry and maximum-terminal-longitude entry. The results show that these two problems cannot be effectively solved using the basic SCP algorithm. However, the proposed algorithm, along with the trust-region SCP algorithm and GPOPS, can solve them efficiently. With comparable accuracy in the obtained solutions, the algorithm proposed in this paper requires only half the CPU time of the trust-region SCP algorithm and just 5 % of the computing time of the general-purpose open-source solver GPOPS.
ISSN:1270-9638
DOI:10.1016/j.ast.2024.109349