Skip to Main content Skip to Navigation
Conference papers

Optimizing Successive Airspace Configurations with a Sequential A * Algorithm

Abstract : 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.
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal-enac.archives-ouvertes.fr/hal-02178437
Contributor : Laurence Porte <>
Submitted on : Tuesday, July 9, 2019 - 7:20:06 PM
Last modification on : Wednesday, February 12, 2020 - 1:21:08 AM

File

ATM_Seminar_2019_paper_29.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02178437, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

52

Files downloads

53