2004
DOI: 10.1016/j.engappai.2004.08.015
|View full text |Cite
|
Sign up to set email alerts
|

On-line free-flight path optimization based on improved genetic algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
27
0

Year Published

2007
2007
2018
2018

Publication Types

Select...
4
2
2

Relationship

1
7

Authors

Journals

citations
Cited by 35 publications
(27 citation statements)
references
References 7 publications
(6 reference statements)
0
27
0
Order By: Relevance
“…At present, pilots fly along static airways under the direction of the ATC. Recently, the Free Flight (FF) is proposed as a concept of operations relying upon improved communication, navigation and surveillance technology to increase pilot and airline freedom ( [9]). One of the primary features of FF is that it allows pilots changing routes with respect to safety, efficiency and flexibility in realtime.…”
Section: Introductionmentioning
confidence: 99%
“…At present, pilots fly along static airways under the direction of the ATC. Recently, the Free Flight (FF) is proposed as a concept of operations relying upon improved communication, navigation and surveillance technology to increase pilot and airline freedom ( [9]). One of the primary features of FF is that it allows pilots changing routes with respect to safety, efficiency and flexibility in realtime.…”
Section: Introductionmentioning
confidence: 99%
“…• Self-adaptive crossover and mutation probabilities are introduced to prevent excellent chromosomes from being destroyed by evolutionary operators and to promote the evolution of inferior chromosomes [22], [23]. The crossover and mutation probabilities are calculated in (12) and (13), shown at the bottom of the page, where P c and P m are, respectively, the crossover and mutation probabilities for evolving a certain chromosome in a certain generation, f max is the maximum fitness in the generation, and f avg is the average fitness of the generation.…”
Section: Heuristic Rules For Setting Algorithm Parametersmentioning
confidence: 99%
“…These approaches don't usually fit the structure described in section 3.1. A flight path minimising the costs of a flight can be computed using dynamic programming [23], genetic algorithms [54], heuristic search algorithms [28], or a combination of both genetic algorithms and heuristic search [90]. Another way of minimising the costs of the flight consists on transforming the trajectory optimization problem into a non-linear programming problem that can be solved using various techniques.…”
Section: Other Approaches To Trajectory Predictionmentioning
confidence: 99%
“…In some cases, the initial and final conditions are specified as 2D points [25,54]. The initial and final conditions may also include state or control variables such as the flight path, heading angles, mass, velocity or a more sophisticated condition formulated by the combination of several state variables [24,29,31,32,36].…”
Section: Other Specifications Of Flightmentioning
confidence: 99%
See 1 more Smart Citation