Tackling Air Traffic Conflicts as a Weighted CSP : Experiments with the Lumberjack Method
Abstract
In this paper, we present an extension to an air traffic conflicts resolution method consisting in generating a large number of trajectories for a set of aircraft, and efficiently selecting the best compatible ones. We propose a multimanoeuvre version which encapsulates different conflict-solving algorithms, in particular an original "smart brute-force" method and the well-known ToulBar2 CSP toolset. Experiments on several benchmarks show that the first one is very efficient on cases involving few aircraft (representative of what actually happens in operations), allowing us to search through a large pool of manoeuvres and trajectories; however, this method is overtaken by its complexity when the number of aircraft increases to 7 and more. Conversely, within acceptable times, the ToulBar2 toolset can handle conflicts involving more aircraft, but with fewer possible trajectories for each.
Cite
@article{arxiv.2001.11390,
title = {Tackling Air Traffic Conflicts as a Weighted CSP : Experiments with the Lumberjack Method},
author = {Thomas Chaboud and Cédric Pralet and Nicolas Schmidt},
journal= {arXiv preprint arXiv:2001.11390},
year = {2020}
}
Comments
Keywords: Constraints Programming, ATC, graph algorithms, clique searching. 15 pages, 6 figures, 2 tables. Creative Commons Attribution-Noncommercial-ShareAlike license (CC BY-NC-SA 4.0)