To solve the non-convex ascent trajectory optimization problem with non-convex dynamic equations and constraints, a convex optimization method is proposed in this paper. The ascent trajectory optimization problem is formulated by giving the ascent dynamic equations and analyzing constraint conditions, which is discretized into a nonlinear programming problem by trapezoidal integration. Then convex methods are researched on discrete constraints and dynamic equations, and an iterative algorithm is proposed based on narrowing trust region constraint. Simulation result proves that the method is faster and more accurate than the pseudo spectral method, and its low requirement of initial value and suitability for the change of terminal state in large range highly improve the efficiency of the ascent optimization.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Convex Method for Ascent Trajectory Optimization Using Iterative Narrowing Trust Region


    Contributors:
    Zhengxiang, Sun (author) / Tao, Chao (author) / Songyan, Wang (author) / Ming, Yang (author)


    Publication date :

    2018-08-01


    Size :

    149142 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Convex Approach to Three-Dimensional Launch Vehicle Ascent Trajectory Optimization

    Benedikter, Boris / Zavoli, Alessandro / Colasurdo, Guido et al. | AIAA | 2021


    Rapid ascent trajectory optimization for guided rockets via sequential convex programming

    Zhang, Kai / Yang, Shuxing / Xiong, Fenfen | SAGE Publications | 2019



    Ascent Trajectory Optimization Using Genetic Algorithm

    Zeeshan, Qasim / Waheed, Abdul / Linshu, He | AIAA | 2009