Application of Compact Representation of Ordered Set to Air Traffic Conflict Resolution

Abstract

The motivation of implementing Adaptive Compact Tree is to improve the performance of Constraint Programming(CP) solvers operations, which is used for en-route conflict resolution in. AC-Trees could not only help CP solver to solve the conflict problem much faster, but also outperform classic BSTs on standard set operations. In addition, we will also present optimizations that improve the performance of the conflict detection for the conflict problem previously mentioned. With these optimizations, the conflict detection phase can be completed in a few seconds. Together with our contribution of the ACTree data structure used in CP solver which accelerates conflict resolution, the total execution time has been reduced significantly, which opens the way to a real-time implementation in an operational context.