Abstract : This paper introduces two methods, tested on a toy problem, which allocate optimal separated 3D-trajectories to air 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.
Type de document :
Communication dans un congrès
CIMCA 2004, international conference on Computational Intelligence for Modelling, Control and Automation, Jul 2004, Gold Coast, Australia. pp xxxx, 2004
https://hal-enac.archives-ouvertes.fr/hal-01020102
Contributeur : Céline Smith
<>
Soumis le : lundi 7 juillet 2014 - 17:07:52
Dernière modification le : lundi 21 mars 2016 - 11:30:49
Document(s) archivé(s) le : mardi 11 avril 2017 - 10:19:23
David Gianazza, Nicolas Durand, Nicolas Archambault. Allocating 3D-trajectories to air traffic flows using A* and genetic algorithms. CIMCA 2004, international conference on Computational Intelligence for Modelling, Control and Automation, Jul 2004, Gold Coast, Australia. pp xxxx, 2004. 〈hal-01020102〉
