Improved sequential convex programming using modified Chebyshev–Picard iteration for ascent trajectory optimization

This paper presents an improved sequential convex programming (SCP) algorithm for ascent trajectory optimization of launch vehicles, by exploiting the state-of-the-art modified Chebyshev–Picard iteration (MCPI) technique. In the proposed algorithm, the MCPI technique is first utilized to transcribe...

Celý popis

Podrobná bibliografia

Vydané v:	Aerospace science and technology Ročník 120; s. 107234
Hlavní autori:	Ma, Yangyang, Pan, Binfeng, Hao, Chuanchuan, Tang, Shuo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Masson SAS 01.01.2022
Predmet:	Launch vehicle Modified Chebyshev–Picard iteration Sequential convex programming Trajectory optimization Launch vehicle Sequential convex programming Modified Chebyshev–Picard iteration Trajectory optimization
ISSN:	1270-9638, 1626-3219
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!