(Created page with " == Abstract == There has been much effort to increase airspace capacity and one of the fundamental research problems is to measure the traffic complexity inside sectors. Thi...") |
m (Scipediacontent moved page Draft Content 187555680 to Lee et al 2007a) |
(No difference)
|
There has been much effort to increase airspace capacity and one of the fundamental research problems is to measure the traffic complexity inside sectors. This paper proposes a new method for describing the air traffic complexity of a given traffic situation. We view the airspace as a closed- loop input-output system and define air traffic complexity as "how difficult" a given traffic situation is, in terms of the control activity required to resolve it, in response to a change in "reference signal", that is the presence of a new aircraft entering the airspace. We present a "complexity map" that offers a graphical view of the complexity for a given traffic situation. We also discuss how to extract a scalar measure of air traffic complexity from the complexity map. We illustrate our methodology with a few examples.
The different versions of the original document can be found in:
Published on 01/01/2007
Volume 2007, 2007
DOI: 10.1109/acc.2007.4282989
Licence: CC BY-NC-SA license
Are you one of the authors of this document?