Traffic Complexity Based Conflict Resolution

摘要

This paper presents a new approach to the development of Conflict Detection and Resolution (CDR) algorithms for a Free Flight environment. Most of the recently proposed CDR algorithms typically attempt to resolve impending conflicts while minimizing trajectory deviations, fuel usage, flight time, or some other "individually-oriented" criterion. However, in this research a newly developed CDR algorithm, the "Minimised number of Aircraft Solve Conflicts" (MASC) algorithm, is described that aims to resolve conflicts from a "collective" optimisation perspective. More specifically, MASC aims at reducing the local traffic complexity in conflict situations in a Free Flight sector. In this study, the results of simulations of several conflict scenarios are discussed and on the basis of so-called Dynamic Density computations, the MASC algorithm is compared with three currently existing CDR algorithms. The computed Dynamic Density time-histories are used as an indication of the local traffic complexity. The developed MASC algorithm shows considerably lower Dynamic Density values than the other three CDR algorithms.