A novel sequential convex (SCvx) optimization scheme via the Chebyshev pseudospectral method is proposed for efficiently solving the hypersonic reentry trajectory optimization problem which is highly constrained by heat flux, dynamic pressure, normal load, and multiple no-fly zones. The Chebyshev-Gauss Legend (CGL) node points are used to transcribe the original dynamic constraint into algebraic equality constraint; therefore, a nonlinear programming (NLP) problem is concave and time-consuming to be solved. The iterative linearization and convexification techniques are proposed to convert the concave constraints into convex constraints; therefore, a sequential convex programming problem can be efficiently solved by convex algorithms. Numerical results and a comparison study reveal that the proposed method is efficient and effective to solve the problem of reentry trajectory optimization with multiple constraints.


    Access

    Download


    Export, share and cite



    Title :

    Efficient Convex Optimization of Reentry Trajectory via the Chebyshev Pseudospectral Method


    Contributors:
    Chun-Mei Yu (author) / Dang-Jun Zhao (author) / Ye Yang (author)


    Publication date :

    2019




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown





    Direct Trajectory Optimization by a Chebyshev Pseudospectral Method

    Fariba Fahroo / I. Michael Ross | AIAA | 2002


    Reentry Trajectory Optimization Based on a Multistage Pseudospectral Method

    Jiang Zhao / Rui Zhou / Xuelian Jin | DOAJ | 2014

    Free access


    Chebyshev Pseudospectral Trajectory Optimization of Differential Inclusion Models

    Bousson, K. / Society of Automotive Engineers | British Library Conference Proceedings | 2003