This paper presents autotuned primal–dual successive convexification (Auto-SCvx), an algorithm designed to reliably achieve dynamically feasible trajectory solutions for constrained hypersonic reentry optimal control problems across a large mission parameter space. In Auto-SCvx, the authors solve a sequence of convex subproblems until convergence to a solution of the original nonconvex problem. This method iteratively optimizes dual variables in closed form in order to update the penalty hyperparameters used in the primal variable updates. A benefit of this method is that it is autotuning and requires no hand tuning by the user with respect to the constraint penalty weights. Several example hypersonic reentry problems are posed and solved using this method, and comparative studies are conducted against current methods. In these numerical studies, our algorithm demonstrates equal and often improved performance while not requiring hand tuning of penalty hyperparameters.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Autotuned Primal–Dual Successive Convexification for Reentry Guidance


    Contributors:


    Publication date :

    2025-07-01




    Type of media :

    Conference paper , Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Auto-Tuned Primal-Dual Successive Convexification for Hypersonic Reentry Guidance

    Mceowen, Skye / Calderone, Daniel J. / Tiwary, Aman et al. | AIAA | 2025


    Successive Convexification for Mars 6-DoF Powered Descent Landing Guidance

    Szmuk, Michael / Eren, Utku / Acikmese, Behcet | AIAA | 2017



    Successive Convexification for Tethered Debris Deorbiting

    Field, Liam / Hecht, Grant / Botta, Eleonora M. | AIAA | 2024