2010
DOI: 10.2514/1.44399
|View full text |Cite
|
Sign up to set email alerts
|

Near-Optimal Trajectories to Manage Landing Sequence in the Vicinity of Controlled Aerodromes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2013
2013

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…One approach expands the original 2D formulation into a 3D framework, but it does not deal with constraints in the climb rate or specific values of these climb rates corresponding to trim conditions, as is the case with motion primitives (Shanmugavel et al 2006). Another variation noted the lack of algebraic solutions for 3D planning using a Dubins airplane, and therefore considered genetic algorithms (Malaek and Nabavi 2010). Complete analogs to the Dubins car in 3D are still being developed to account for the shortest path between two points with associated heading constraints (Chitsaz and LaValle 2007) and heading and flight-path angle constraints (Ambrosino et al 2006).…”
Section: Introductionmentioning
confidence: 99%
“…One approach expands the original 2D formulation into a 3D framework, but it does not deal with constraints in the climb rate or specific values of these climb rates corresponding to trim conditions, as is the case with motion primitives (Shanmugavel et al 2006). Another variation noted the lack of algebraic solutions for 3D planning using a Dubins airplane, and therefore considered genetic algorithms (Malaek and Nabavi 2010). Complete analogs to the Dubins car in 3D are still being developed to account for the shortest path between two points with associated heading constraints (Chitsaz and LaValle 2007) and heading and flight-path angle constraints (Ambrosino et al 2006).…”
Section: Introductionmentioning
confidence: 99%