Re-entry trajectory planning for hypersonic morphing vehicles using penalty sequence convex programming

To realize continuous leapfrog upgrades of the hypersonic vehicle from single-point optimal fixed configuration to full envelope optimal of morphing configuration, a quasi-wave rider profile and composite deformation scheme morphing wingspan and sweep are designed. On this basis, to reduce the computational burdens of reentry trajectory planning, the adaptive trust-region-based penalty sequence convex programming method is proposed. To increase the approximate accuracy, the path restrictions are communicated using the logarithmic convexification technique. A virtual control is introduced to replace the dynamic equation constraints. Using the penalty function method, modify the second-order cone constraint and incorporate it into the objective function to direct the iterative results in order to approximate the feasible domain. An adaptive trust region updating strategy is designed to accelerate the convergence of the sequence convex optimization algorithm. As demonstrated by the simulation results, the hypersonic morphing vehicle's range extension is 16.63% when compared to the fixed configuration, and the ATP-SCP computing time is 89.24% less than when compared to the HP pseudospectral method.