The gradient method in function space is revisited and applied to the problem of optimizing the trajectories of aerodynamically maneuvering rockets. The optimization objective may be the maximal range or the minimal control effort for a given range. The method is shown to provide an implementable and fast algorithm for a good approximation to the optimal solution. It does not require any non-linear programming solver, and can be straightforwardly programmed in a flight computer. The method can also be used to provide an initial guess for more precise techniques, thus accelerating the computational process.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Revisiting gradient methods in function space with application to rocket trajectories


    Contributors:


    Publication date :

    2015-07-01


    Size :

    319437 byte



    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Optimal Rocket Trajectories Using Gradient Methods

    Ben-Asher, Joseph Z. | British Library Conference Proceedings | 2016


    Minimal rocket trajectories

    Lawden, D.F. | Engineering Index Backfile | 1953


    Some optimum rocket trajectories

    Leitmann, G. | Engineering Index Backfile | 1961


    Low-Thrust Rocket Trajectories

    P. W. Keaton | NTIS | 1987


    Some optimum rocket trajectories

    Leitmann, G. | Engineering Index Backfile | 1961