The dynamic-programming technique developed by R. Bellman is applied to the solution of the airplane minimum time-to-climb problem. A brief introduction to dynamic programming is presented, followed by an exposition of the climb problem and the solution of a typical example case. It is concluded that dynamic programming offers a method of solution for the climb problem which is fast, is readily adaptable to routine engineering calculation, and allows the inclusion of the effects of variations in airplane weight and drag along the flight path. (Author)


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Application of Dynamic Programming to the Airplane Minimum Time-To-Climb Problem


    Contributors:

    Publication date :

    1956


    Size :

    22 pages


    Type of media :

    Report


    Type of material :

    No indication


    Language :

    English





    Application of dynamic programing to airplane minimum time-to-climb problem

    Cartaino, T.F. / Dreyfus, S.E. | Engineering Index Backfile | 1957


    Airplane Climb Thrust Optimization

    DIRUSSO JOSEPH M / PARSONS KEITH D | European Patent Office | 2019

    Free access

    Airplane climb thrust optimization

    DIRUSSO JOSEPH M / PARSONS KEITH D | European Patent Office | 2020

    Free access

    Airplane climb thrust optimization

    DIRUSSO JOSEPH M / PARSONS KEITH D | European Patent Office | 2022

    Free access