Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


ucin1116120758.pdf (1.1 MB)

ETD Abstract Container

Abstract Header

A DYNAMIC PROGRAMMING APPROACH TO OPTIMAL CENTER DELAY ALLOCATION

YANG, DONGMEI
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1116120758

Abstract Details

2005, MS, University of Cincinnati, Engineering : Aerospace Engineering.
Due to the runway threshold and airport capacity constraints, aircraft are often required to delay their arrival time when they are approaching the TRACON (Terminal Radar Approach Control) area to meet separation requirements and to ensure safety. This is particularly true in the US in the northeast corridor, where sectors are small, with shorter controllable time, and involving very complex and heavy traffic flows. In this situation, downstream schedule constraints may be passed upstream, most likely across multiple ARTCCs (Air Route Traffic Control Centers) and multiple sectors. More sectors may be needed to absorb the required delay. The technical issue for delaying aircraft over extended region is that uncertainties in flight time, and the rather close tolerance on final spacing, make delay predictions far into the future rather suspect. This paper provides a delay strategy that the problem of distributing delay across multiple sectors is addressed as a discrete optimal control problem. Game theory, coupled with dynamic programming (DP) is used in this research to give an optimal solution for the delay controls in each sector. In this application the sector delay is chosen to minimize a performance index and the uncertainty is viewed as an adversary trying to maximize the performance index. This DP approach is capable of creating a favorable delay distribution solution and the solution is fuel efficient. It is easy for controller to implement because the algorithm is computationally efficient, the method can quickly reallocate the delay by adjusting the model parameters to provide a robust solution. As currently formulated the DP algorithm ensures only separation at the terminal fix. However, at several intermediate points, the traffic may merge into a single stream from several directions. An algorithm is developed to integrate the DP algorithm so as to solve the intermediate merging conflict as well as ensuring terminal separation. The validity of this mechanism is examined in a realistic traffic scenario simulation involving several intermediate merge points representative of traffic into the Philadelphia airport.
Dr. Gary Slater (Advisor)
87 p.
Air Traffic Management; Air Traffic Control; Trajectory Optimization; Multi-Center Traffic Management Advisor (McTMA); Optimal Delay Allocation; Dynamic Programming

Recommended Citations

Citations

  • YANG, D. (2005). A DYNAMIC PROGRAMMING APPROACH TO OPTIMAL CENTER DELAY ALLOCATION [Master's thesis, University of Cincinnati]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1116120758

    APA Style (7th edition)

  • YANG, DONGMEI. A DYNAMIC PROGRAMMING APPROACH TO OPTIMAL CENTER DELAY ALLOCATION. 2005. University of Cincinnati, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ucin1116120758.

    MLA Style (8th edition)

  • YANG, DONGMEI. "A DYNAMIC PROGRAMMING APPROACH TO OPTIMAL CENTER DELAY ALLOCATION." Master's thesis, University of Cincinnati, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1116120758

    Chicago Manual of Style (17th edition)

ucin1116120758
793
© 2005, all rights reserved.
This open access ETD is published by University of Cincinnati and OhioLINK.