Air traffic complexity

Keumjin Lee, Eric Feron, Amy Pritchett

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

This paper addresses the question of extracting "air traffic complexity" from given aircraft position and speed data. Airspace complexity aims at describing "how difficult" a given aircraft configuration is, from the standpoint of the air traffic controller working with or without aiding devices. In this paper, we attempt to find "airspace transforms", that is, maps from airspace configurations to graphics that extract and clearly display the state of the system relative to some measure of risk. Building on system-Theoretic concepts, fast optimization tools and the seminal work of John Andrews (Lincoln Laboratory), we propose a set of possible airspace transforms that appear to achieve this goal. We discuss how such transforms might be useful as decision aids. We also postulate scalar measures of "air traffic complexity" and illustrate our approach on a few examples.

Original languageEnglish (US)
Title of host publication44th Annual Allerton Conference on Communication, Control, and Computing 2006
PublisherUniversity of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Pages1358-1363
Number of pages6
ISBN (Electronic)9781604237924
StatePublished - Jan 1 2006
Event44th Annual Allerton Conference on Communication, Control, and Computing 2006 - Monticello, United States
Duration: Sep 27 2006Sep 29 2006

Publication series

Name44th Annual Allerton Conference on Communication, Control, and Computing 2006
Volume3

Other

Other44th Annual Allerton Conference on Communication, Control, and Computing 2006
CountryUnited States
CityMonticello
Period9/27/069/29/06

Fingerprint

Air
Aircraft
Controllers

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Lee, K., Feron, E., & Pritchett, A. (2006). Air traffic complexity. In 44th Annual Allerton Conference on Communication, Control, and Computing 2006 (pp. 1358-1363). (44th Annual Allerton Conference on Communication, Control, and Computing 2006; Vol. 3). University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering.
Lee, Keumjin ; Feron, Eric ; Pritchett, Amy. / Air traffic complexity. 44th Annual Allerton Conference on Communication, Control, and Computing 2006. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2006. pp. 1358-1363 (44th Annual Allerton Conference on Communication, Control, and Computing 2006).
@inproceedings{590f464e4ad54142a1718950e2c83d16,
title = "Air traffic complexity",
abstract = "This paper addresses the question of extracting {"}air traffic complexity{"} from given aircraft position and speed data. Airspace complexity aims at describing {"}how difficult{"} a given aircraft configuration is, from the standpoint of the air traffic controller working with or without aiding devices. In this paper, we attempt to find {"}airspace transforms{"}, that is, maps from airspace configurations to graphics that extract and clearly display the state of the system relative to some measure of risk. Building on system-Theoretic concepts, fast optimization tools and the seminal work of John Andrews (Lincoln Laboratory), we propose a set of possible airspace transforms that appear to achieve this goal. We discuss how such transforms might be useful as decision aids. We also postulate scalar measures of {"}air traffic complexity{"} and illustrate our approach on a few examples.",
author = "Keumjin Lee and Eric Feron and Amy Pritchett",
year = "2006",
month = "1",
day = "1",
language = "English (US)",
series = "44th Annual Allerton Conference on Communication, Control, and Computing 2006",
publisher = "University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering",
pages = "1358--1363",
booktitle = "44th Annual Allerton Conference on Communication, Control, and Computing 2006",

}

Lee, K, Feron, E & Pritchett, A 2006, Air traffic complexity. in 44th Annual Allerton Conference on Communication, Control, and Computing 2006. 44th Annual Allerton Conference on Communication, Control, and Computing 2006, vol. 3, University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, pp. 1358-1363, 44th Annual Allerton Conference on Communication, Control, and Computing 2006, Monticello, United States, 9/27/06.

Air traffic complexity. / Lee, Keumjin; Feron, Eric; Pritchett, Amy.

44th Annual Allerton Conference on Communication, Control, and Computing 2006. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2006. p. 1358-1363 (44th Annual Allerton Conference on Communication, Control, and Computing 2006; Vol. 3).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Air traffic complexity

AU - Lee, Keumjin

AU - Feron, Eric

AU - Pritchett, Amy

PY - 2006/1/1

Y1 - 2006/1/1

N2 - This paper addresses the question of extracting "air traffic complexity" from given aircraft position and speed data. Airspace complexity aims at describing "how difficult" a given aircraft configuration is, from the standpoint of the air traffic controller working with or without aiding devices. In this paper, we attempt to find "airspace transforms", that is, maps from airspace configurations to graphics that extract and clearly display the state of the system relative to some measure of risk. Building on system-Theoretic concepts, fast optimization tools and the seminal work of John Andrews (Lincoln Laboratory), we propose a set of possible airspace transforms that appear to achieve this goal. We discuss how such transforms might be useful as decision aids. We also postulate scalar measures of "air traffic complexity" and illustrate our approach on a few examples.

AB - This paper addresses the question of extracting "air traffic complexity" from given aircraft position and speed data. Airspace complexity aims at describing "how difficult" a given aircraft configuration is, from the standpoint of the air traffic controller working with or without aiding devices. In this paper, we attempt to find "airspace transforms", that is, maps from airspace configurations to graphics that extract and clearly display the state of the system relative to some measure of risk. Building on system-Theoretic concepts, fast optimization tools and the seminal work of John Andrews (Lincoln Laboratory), we propose a set of possible airspace transforms that appear to achieve this goal. We discuss how such transforms might be useful as decision aids. We also postulate scalar measures of "air traffic complexity" and illustrate our approach on a few examples.

UR - http://www.scopus.com/inward/record.url?scp=72449146634&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=72449146634&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:72449146634

T3 - 44th Annual Allerton Conference on Communication, Control, and Computing 2006

SP - 1358

EP - 1363

BT - 44th Annual Allerton Conference on Communication, Control, and Computing 2006

PB - University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering

ER -

Lee K, Feron E, Pritchett A. Air traffic complexity. In 44th Annual Allerton Conference on Communication, Control, and Computing 2006. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering. 2006. p. 1358-1363. (44th Annual Allerton Conference on Communication, Control, and Computing 2006).