Oscillation Phenomenon in Trust-Region-Based Sequential Convex Programming for the Nonlinear Trajectory Planning Problem

The trust-region-based sequential convex programming (TSCP) method is designed to solve the nonlinear trajectory planning problem using successive linearization and trust region. The TSCP method has a good real-time performance suitable for onboard aerospace applications. However, the main challenge...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on aerospace and electronic systems Ročník 58; číslo 4; s. 3337 - 3352
Hlavní autoři: Xie, Lei, He, Rui-Zhi, Zhang, Hong-Bo, Tang, Guo-Jian
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.08.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Aerospace engineering
Convergence
Convexity
Nonlinear trajectory planning
oscillation phenomenon
Oscillators
Planning
Programming
Reentry trajectories
sequential convex programming
Trajectory
Trajectory planning
trust region
ISSN:0018-9251, 1557-9603
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 trust-region-based sequential convex programming (TSCP) method is designed to solve the nonlinear trajectory planning problem using successive linearization and trust region. The TSCP method has a good real-time performance suitable for onboard aerospace applications. However, the main challenge in practical applications is its poor convergence. In this article, we reveal an oscillation phenomenon, which is an important factor affecting the convergence. The main contribution of this article is threefold: 1) the oscillation phenomenon is proved to be an inherent property of the TSCP method for the nonlinear trajectory planning problem; 2) the oscillation condition that determines whether oscillation occurs is obtained; and 3) the oscillation-condition-based remedy to address the oscillation is presented. The effectiveness and robustness of the proposed remedy have been verified via a complex reentry trajectory planning problem.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9251
1557-9603
DOI:10.1109/TAES.2022.3153761