Abstract

linear time-varying aggregate traffic flow model can be used t o develop Traffic Flow Management strategies based on optimization algorithms. However, there are no methods available in the literature to translate these aggregate solutions into actions involving individual aircraft. This paper describes and implements a computationally efficient disaggregation algorithm, which converts an aggregate (flow-based) solution to a flight-specific control action. Numerical results generated by the optimization method and the disaggregation algorithm are presented and illustrated by applying them to generate TFM schedules for a typical day in the U.S. National Airspace System. The results show that the disaggregation algorithm generates control actions for individual flights while keeping the air traffic behavior very close to the optimal solution.


Original document

The different versions of the original document can be found in:

http://dx.doi.org/10.2514/6.2009-6007
https://www.aviationsystems.arc.nasa.gov/publications/2009/AF2009179.pdf,
https://www.aviationsystemsdivision.arc.nasa.gov/publications/2009/AF2009179.pdf,
http://web.ics.purdue.edu/~dsun/pubs/gnc09.pdf,
https://ntrs.nasa.gov/search.jsp?R=20110010861,
https://arc.aiaa.org/doi/pdf/10.2514/6.2009-6007,
https://trid.trb.org/view/1125915,
https://repository.exst.jaxa.jp/dspace/handle/a-is/247555,
http://enu.kz/repository/2009/AIAA-2009-6007.pdf,
https://academic.microsoft.com/#/detail/2117750143
Back to Top

Document information

Published on 01/01/2009

Volume 2009, 2009
DOI: 10.2514/6.2009-6007
Licence: CC BY-NC-SA license

Document Score

0

Views 0
Recommendations 0

Share this document

Keywords

claim authorship

Are you one of the authors of this document?