A general scheduling algorithm for aircraft from terminal area entry to touchdown is developed. The method has the following novel features: (1) many speed classes of aircraft are considered and speed variations within classes and along portions of the flight path are permitted; (2) multiple paths are considered which may merge or diverge - the analysis is not restricted to a single runway nor to departures only; (3) landings are scheduled along conflict free flight paths in minimum time. The algorithm is currently being incorporated in a fast-time simulation of a STOL air traffic system.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Automated aircraft scheduling methods in the near terminal area.


    Contributors:
    Tobias, L. (author)

    Conference:

    American Institute of Aeronautics and Astronautics, Aerospace Sciences Meeting ; 1972 ; San Diego, CA


    Publication date :

    1972-01-01


    Type of media :

    Conference paper


    Type of material :

    No indication


    Language :

    English


    Keywords :