The flight navigation procedures envisioned under the Next Generation Transportation System will require a specification of the expected route of each flight. Once these specifications are provided, the flights must proceed along their routes with such speed profiles that every pair of aircraft complies with the minimal separation requirement imposed by the Federal Aviation Administration. The task of separation assurance is most challenging in terminal airspace, with many routes merging and crossing. This paper contributes a mathematical model and an algorithmic approach for routing flights strategically, with a foresight that potentially helps the subsequent computation of speed profiles compliant with the separation requirements and with each aircraft’s feasible speed range. The approach consists of reducing a general routing problem to the shortest-path problem.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Application of the Shortest-Path Problem to Routing Terminal Airspace Air Traffic


    Contributors:

    Published in:

    Publication date :

    2014-03-20


    Size :

    13 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    The Shortest Path Problem Revisited: Optimal Routing for Electric Vehicles

    Andreas Artmeier, Julian Haselmayr, Martin Leucker, Martin Sachenbacher | BASE | 2010

    Free access

    An Evaluation of Airport Traffic Airspace Use by Terminal Airspace Class

    Underhill, Ngaire / Weinert, Andrew | IEEE | 2019


    Dynamic Noise Avoidance Routing Through Terminal Airspace

    Capozzi, Brian / Augustine, Stephen / Thompson, Terry | AIAA | 2003


    The Shortest Path Problem Research Based on the Green Traffic

    Liu, B. Y. / Jin, N. X. | British Library Conference Proceedings | 2015