Sequential convex programming without penalty function for reentry trajectory optimization problem

Sequential convex programming (SCP) has been extensively utilized in reentry trajectory optimization due to its high computational efficiency. However, the current SCP approaches primarily rely on penalty function, where the selection of the penalty function weight presents a significant challenge....

Full description

Saved in:
Bibliographic Details
Published in:Acta astronautica Vol. 225; pp. 402 - 416
Main Authors: Dong, Cheng-Long, Xie, Lei, He, Rui-Zhi, Zhang, Hong-Bo
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.12.2024
Subjects:
ISSN:0094-5765
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first