hp-Adaptive RPD based sequential convex programming for reentry trajectory optimization

Sequential convex programming (SCP) methods have been developed to solve reentry trajectory optimization problems. Due to the oversimplified discretization and iteration, the accuracy and efficiency of the existing SCP methods can be further improved. In this paper, a SCP algorithm based on the hp-a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Aerospace science and technology Jg. 130; S. 107887
Hauptverfasser: Zhang, Tengfei, Su, Hua, Gong, Chunlin
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Masson SAS 01.11.2022
Schlagworte:
hp-adaptive
Radau pseudospectral
Reentry
Sequential convex programming
Trajectory optimization
Sequential convex programming
hp-adaptive
Reentry
Trajectory optimization
Radau pseudospectral
ISSN:1270-9638, 1626-3219
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Sequential convex programming (SCP) methods have been developed to solve reentry trajectory optimization problems. Due to the oversimplified discretization and iteration, the accuracy and efficiency of the existing SCP methods can be further improved. In this paper, a SCP algorithm based on the hp-adaptive Radau pseudospectral discretization (RPD) is proposed. In the proposed algorithm, the iteration process is divided into three stages depending on the characteristics of subproblems. The constraint relaxation technique is applied in the first stage to ensure that the iteration is stable. During the second stage, the number and position of discretized points will be updated adaptively according to the discretization error and the curvature of state. In the last stage, the linearization error is reduced by several iterations without updating mesh, and the regularization technique is utilized to improve the convergence rate of this process. The proposed algorithm is validated and examined by a typical reentry example. With comparable or even higher results accuracy, the CPU time reduced by 40%-70% when compared to other SCP methods, and is only twentieth of that of GPOPS-II.
ISSN:1270-9638
1626-3219
DOI:10.1016/j.ast.2022.107887