Optimizing Successive Airspace Configurations with a Sequential A * Algorithm - ENAC - École nationale de l'aviation civile Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Optimizing Successive Airspace Configurations with a Sequential A * Algorithm

David Gianazza

Résumé

In this paper, we introduce exact tree search algorithms which explore all the possible sequences of airspace partitions , taking into account some constraints on the transitions between two successive airspace configurations. The transitions should be simple enough to allow air traffic controllers to maintain their situation awareness during the airspace configuration changes. For the same reason, once a sector is opened it should remain so for a minimum duration. The proposed method is a sequential A * algorithm with a rolling horizon. It finds a sequence of airspace configurations minimizing a cost related to the workload and the usage of manpower resources, while satisfying the transition constraints. This approach shows good results on 9 months of data from the french ATCC Aix (East), when compared with two baseline methods, one with a greedy approach and the other with no transition constraints.
Fichier principal
Vignette du fichier
ATM_Seminar_2019_paper_29.pdf (472.09 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02178437 , version 1 (09-07-2019)

Identifiants

  • HAL Id : hal-02178437 , version 1

Citer

David Gianazza. Optimizing Successive Airspace Configurations with a Sequential A * Algorithm. ATM 2019, 13th USA/Europe Air Traffic Management Research and Development Seminar, Jun 2019, Vienne, Austria. ⟨hal-02178437⟩
84 Consultations
84 Téléchargements

Partager

Gmail Facebook X LinkedIn More