Reduced Space Sequential Convex Programming for Rapid Trajectory Optimization

Convex optimization is of great interest as an efficient and reliable solver in the field of aerospace engineering. Existing research often focuses on developing proper convexification techniques to handle aerospace problems within the convex optimization framework, with limited attention to further...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on aerospace and electronic systems Ročník 60; číslo 6; s. 9060 - 9072
Hlavní autori: Ma, Yangyang, Pan, Binfeng, Tang, Jingyuan
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.12.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Aerodynamics
Aerospace engineering
Constraints
Convergence
Convex analysis
Convex functions
Convexity
Implicit function
Iterative methods
Optimization
Programming
Real variables
Real-time programming
reduced space framework
sequential convex programming (SCP)
Space vehicles
Trajectory optimization
ISSN:0018-9251, 1557-9603
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Convex optimization is of great interest as an efficient and reliable solver in the field of aerospace engineering. Existing research often focuses on developing proper convexification techniques to handle aerospace problems within the convex optimization framework, with limited attention to further efficiency enhancements in convex optimization solving, such as by reducing the optimization problem size. Motivated by the real-time requirements of onboard aerospac applications, this article presents a unified framework for reduced space sequential convex programming formulations, emphasizing a significant reduction of optimization variables and constraints. The primary idea is to employ an iterative scheme to explicitly approximate the dynamic implicit function and subsequently eliminate the explicitly defined state variables and dynamic equality constraints, thereby constructing a sequence of reduced space optimization subproblems to be solved iteratively. Within the proposed framework, a family of reduced space sequential convex programming methods with different performance-complexity tradeoffs is developed by virtue of the fixed-point iteration, Newton iteration, damped Newton iteration, and simplified Newton iteration. Numerical simulations for a minimum-fuel rocket landing problem inside atmosphere are conducted to demonstrate the performance of the developed methods.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9251
1557-9603
DOI:10.1109/TAES.2024.3437330