Feasible Sequential Convex Programming With Inexact Restoration for Multistage Ascent Trajectory Optimization

This article presents a feasible sequential convex programming method to solve the multistage ascent trajectory optimization problem. The proposed method is based on the inexact restoration technique, in which a more feasible intermediate iterate is first produced by solving a constrained least-squa...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on aerospace and electronic systems Jg. 59; H. 2; S. 1217 - 1230
Hauptverfasser: Ma, Yangyang, Pan, Binfeng, Yan, Rui
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.04.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Aerodynamics
Ascent trajectories
Ascent trajectory optimization
Chebyshev approximation
Computational geometry
Convergence
Convexity
feasible sequential convex programming
inexact restoration (IR)
Iterative methods
launch vehicle
Least squares method
Mathematical programming
Orbits
Picard iterations
Polynomials
Programming
Restoration
Robustness
Robustness (mathematics)
Trajectory optimization
Vehicle dynamics
ISSN:0018-9251, 1557-9603
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This article presents a feasible sequential convex programming method to solve the multistage ascent trajectory optimization problem. The proposed method is based on the inexact restoration technique, in which a more feasible intermediate iterate is first produced by solving a constrained least-squares problem, and then a more optimal iterate is generated by solving a convex programming problem constructed around the newly found feasible solution. By virtue of the inexact restoration idea, the proposed method prevents the common artificial infeasibility issue and can provide the intermediate iterate as a feasible suboptimal solution if the algorithmic procedure terminates before convergence. In addition, the Picard iteration-based convexification and Chebyshev polynomial-based discretization methods are employed in the proposed method, given their benefits in terms of robustness, efficiency, and solution accuracy. Numerical simulations for a minimum-time launch ascent problem are conducted, and the results show that the proposed method exhibits better practical performance than other sequential convex programming methods.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9251
1557-9603
DOI:10.1109/TAES.2022.3196636