Multitask-constrained reentry trajectory planning for hypersonic gliding vehicle

This paper studies the reentry trajectory planning problems for hypersonic gliding vehicle under multiple tasks. Different from the former achievements, this paper takes into account the practical tasks involved in the reentry phase, including penetration of interceptors, evasion of the no-fly zones...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Aerospace science and technology Jg. 155; S. 109636
Hauptverfasser: Huang, Ang, Yu, Jianglong, Liu, Yumeng, Hua, Yongzhao, Dong, Xiwang, Ren, Zhang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Masson SAS 01.12.2024
Schlagworte:
Multitask
Reentry trajectory planning
Sequential convex programming
Multitask
Sequential convex programming
Reentry trajectory planning
ISSN:1270-9638
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper studies the reentry trajectory planning problems for hypersonic gliding vehicle under multiple tasks. Different from the former achievements, this paper takes into account the practical tasks involved in the reentry phase, including penetration of interceptors, evasion of the no-fly zones, and the arrival of the waypoints. Firstly, the constraints during the reentry phase are analyzed in detail, and the original trajectory planning problem is formulated. Secondly, the hp-adaptive pseudospectral discretization method is proposed to effectively reduce the discretization error. Relevant variables are introduced to relax and transform severe intractable constraints of multiple nonconvex forms, thus enhancing the robustness of the planning process. Thirdly, the improved sequential convex programming with decision variables algorithm is proposed to ensure the converged trajectory satisfies complicated tasks. The theoretical analysis is also presented to demonstrate that the converged trajectory is the approximate stationary solution of the discrete form of the original problem. Finally, the effectiveness of the proposed algorithms is validated through numerical simulation. •Three types of reentry tasks related to the interceptors, the waypoints, and the no-fly zones are considered in this paper.•Exponential function penalty terms and logical variables are introduced to relax the constraints of no-fly zones and waypoints.•The ISCPWDV algorithm is proposed to handle the trajectory planning problem where multiple slack variables coexist. The convergence of the algorithm is also analyzed.
ISSN:1270-9638
DOI:10.1016/j.ast.2024.109636