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.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    Optimal Arrival Traffic Spacing via Dynamic Programming


    Beteiligte:
    A. M. Bayen (Autor:in) / T. Callantine (Autor:in) / C. J. Tomlin (Autor:in) / Y. Ye (Autor:in) / J. Zhang (Autor:in)

    Erscheinungsdatum :

    2004


    Format / Umfang :

    9 pages


    Medientyp :

    Report


    Format :

    Keine Angabe


    Sprache :

    Englisch




    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 | Europäisches Patentamt | 2020

    Freier Zugriff

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

    DE PRINS JOHAN | Europäisches Patentamt | 2015

    Freier Zugriff