Convex formulations of aggregate network air traffic flow optimization problems

Daniel B. Work, Alexandre M. Bayen

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

Abstract

The problem of regulating air traffic in the en route airspace of the National Airspace System is studied using an Eulerian network model to describe air traffic flow. The evolution of traffic on each edge of the network is modeled by a modified Lighthill-Whitham-Richards partial differential equation. We pose the problem of optimal traffic flow regulation as a continuous optimization program in which the partial differential equation appears in the constraints. The equation is transformed with a variable change which removes the nonlinearity in the control variables and enables us to use linear finite difference schemes to discretize the problem. Corresponding linear programming and quadratic programming based solutions to this convex optimization program yield a globally optimal solution. The technique is applied for a network scenario in the Oakland Air Route Traffic Control Center.

Original languageEnglish (US)
Title of host publicationProceedings of the 47th IEEE Conference on Decision and Control, CDC 2008
Pages2141-2147
Number of pages7
DOIs
StatePublished - Dec 1 2008
Event47th IEEE Conference on Decision and Control, CDC 2008 - Cancun, Mexico
Duration: Dec 9 2008Dec 11 2008

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0191-2216

Other

Other47th IEEE Conference on Decision and Control, CDC 2008
CountryMexico
CityCancun
Period12/9/0812/11/08

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'Convex formulations of aggregate network air traffic flow optimization problems'. Together they form a unique fingerprint.

Cite this