We present the application of dynamic programming to a combinatorial optimization problem to achieve proper arrival runway spacing, which appears in the process of assigning speed during the transition to approach and approach phases of flight. We apply the algorithm to data from a fast-time simulation developed under NASA's Advanced Air Transportation Technologies Project for investigating new air traffic management (ATM) concepts. For this research, the simulation is configured to simulate traffic inbound along two arrivals to the Dallas/Ft. Worth (DFW) airport, merging into a single stream at fix just prior to the final approach fix. We show how the algorithm computes the maximum minimum spacing between aircraft upon landing, and investigate the sensitivity of the spacing to perturbations.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Optimal Arrival Traffic Spacing via Dynamic Programming


    Contributors:
    A. M. Bayen (author) / T. Callantine (author) / C. J. Tomlin (author) / Y. Ye (author) / J. Zhang (author)

    Publication date :

    2004


    Size :

    9 pages


    Type of media :

    Report


    Type of material :

    No indication


    Language :

    English




    Optimal Arrival Traffic Spacing via Dynamic Programming

    Bayen, Alexandre / Callantine, Todd / Tomlin, Claire et al. | AIAA | 2004


    AIAA-2004-5228 Optimal Arrival Traffic Spacing via Dynamic Programming

    Bayen, A. / Callantine, T. / Tomlin, C. et al. | British Library Conference Proceedings | 2004



    Arrival Traffic Scheduling System Incorporating Equipage-Dependent In-Trail Spacing

    DE PRINS JOHAN | European Patent Office | 2015

    Free access

    Arrival Traffic scheduling system incorporating equipage-dependent in-trial spacing

    DE PRINS JOHAN | European Patent Office | 2016

    Free access