2020
DOI: 10.1007/s40295-020-00235-y
|View full text |Cite
|
Sign up to set email alerts
|

An Iterative Convex Programming Method for Rocket Landing Trajectory Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 30 publications
0
1
0
Order By: Relevance
“…The validity of the approach is ensured by an ad-hoc choice of the static trust regions. The weak point in this case might be a slow convergence, and further strategies might be needed to improve the quality of the process [16,27]. In the latter strategy some variable transformations are introduced to try to keep in the limits of the constraints of the problem some features of the nonlinear formulation.…”
Section: Introductionmentioning
confidence: 99%
“…The validity of the approach is ensured by an ad-hoc choice of the static trust regions. The weak point in this case might be a slow convergence, and further strategies might be needed to improve the quality of the process [16,27]. In the latter strategy some variable transformations are introduced to try to keep in the limits of the constraints of the problem some features of the nonlinear formulation.…”
Section: Introductionmentioning
confidence: 99%
“…Direct methods involve transforming OCP problems into finite-dimensional parameter optimization problems through discretization methods, subsequently solved using nonlinear solvers. By combining convex optimization theory and the pseudospectral method, direct methods offer advantages in real-time performance and solution accuracy and have been successfully applied to solving many OCP problems [12][13][14]. Ref.…”
Section: Introductionmentioning
confidence: 99%