You are here: Home Past Seminars 5th Seminar - Budapest, Hungary - June 2003 Papers A Traffic Complexity Approach Through ...
Document Actions

Paper 33 -- A Traffic Complexity Approach Through Cluster Analysis

The conflict resolution problem is quite simple as long as the numberof aircraft involved is small. Many automation projects disregarded theproblem of clusters and failed on real traffic tests because they wereunable to deal with complex conflicts. The first definition ofcluster appeared in the middle of the nineties when theoretical research started onconflict resolution. The n-aircraft conflict resolution problemis highly combinational and cannot be optimally solvedusing classical mathematical optimisation techniques.The set of admissible solutions is made ofmany unconnected subsets enclosing different local optima, but thesubset enclosing the optimum cannot be found a priori.Using a priority order to solve a n-aircraft conflict is much easierbut the solution is not optimal. However it is difficult to determinethe best order or even a good order that ensures that a solutionexists.In this paper, a theoretical study of the possible structures ofclusters is presented. A simulation using French real traffic data compares thestructure of clusters with direct and standard routes. The sensitivityof cluster sizes to uncertainties on trajectories forecast is studied.
Theme: Metrics and Performance Management
Posted by: Nicolas Durand / Other authors: Giraud Granger
Note: Unset Received On Dec 20, 2005

| Site Map | Accessibility | Contact |

Hosted and maintained by EUROCONTROL