Abstract

International audience; This paper introduces two algorithms which allocate optimal separated 3D-trajectories to the main traffic flows. The first approach is a 1 vs. n strategy which applies an A* algorithm iteratively to each flow. The second is a global approach using a genetic algorithm, applied to a population of trajectory sets. The algorithms are first tried on a toy problem, and then applied to real traffic data, using operational aircraft performances. The cumulated costs of the trajectory deviations are used to compare the two algorithms.


Original document

The different versions of the original document can be found in:

http://dx.doi.org/10.1109/dasc.2004.1391275
https://hal-enac.archives-ouvertes.fr/hal-00938063/document,
https://hal-enac.archives-ouvertes.fr/hal-00938063/file/Gianazza_DASC2004.pdf
https://hal-enac.archives-ouvertes.fr/hal-00938063,
https://hal.archives-ouvertes.fr/hal-00938063,
https://ieeexplore.ieee.org/document/1391275,
https://academic.microsoft.com/#/detail/1577474388
Back to Top

Document information

Published on 01/01/2004

Volume 2004, 2004
DOI: 10.1109/dasc.2004.1391275
Licence: CC BY-NC-SA license

Document Score

0

Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?