2021
DOI: 10.2514/1.g005529
|View full text |Cite
|
Sign up to set email alerts
|

Computationally Efficient Trajectory Generation for Smooth Aircraft Flight Level Changes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 21 publications
0
3
0
Order By: Relevance
“…The idea is to reformulate a class of nonlinear guidance with path and terminal constraints into a generic quadratic programming (QP) and then to solve problems of the SQP concept. In this regard, a scheme with five foundational elements is developed and tailored to the requirements of missions by Reference [36].…”
Section: Trajectory Optimization Methodsmentioning
confidence: 99%
“…The idea is to reformulate a class of nonlinear guidance with path and terminal constraints into a generic quadratic programming (QP) and then to solve problems of the SQP concept. In this regard, a scheme with five foundational elements is developed and tailored to the requirements of missions by Reference [36].…”
Section: Trajectory Optimization Methodsmentioning
confidence: 99%
“…In our approach the time, 𝑡 𝑓 , at the end of the trajectory is unknown. A commonly-used method to deal with free final-time problems is to rewrite the dynamics equations as functions of an independent variable other than time [58][59][60]. In consequence, we choose the longitudinal distance, 𝑠, as the evolution variable and the time, 𝑡, becomes a state component.…”
Section: B Optimal Control Formulationmentioning
confidence: 99%
“…In this study, the goal is to have a very fast algorithm but one that is adaptable to any type of emergency situation. Hong et al [11] propose a computationally efficient method to generate a smooth level change in trajectory. Their proposed algorithm consists of a line search method in combination with a fixed-horizon sequential convex optimization method.…”
Section: Trajectory Generation Algorithmmentioning
confidence: 99%