Abstract

This paper aims to suggest a new landing guidance algorithm for reusable launch vehicles (RLVs) to enable generation of fuel-efficient trajectories based on successive convex programming. To this end, a dual aero/propulsive landing guidance problem is first formulated to fully exploit the additional moment generated by the aerodynamic control to reduce the propulsion demand required for attitude control. As the result of the aerodynamic landing phase could greatly affect the fuel-optimal trajectory during the vertical landing phase, the formulation is further extended to the multi-phase optimal guidance problem using state-triggered constraints. The proposed guidance strategy is then obtained by solving the formulated optimal control problem based on the successive convex optimization framework using an interior point method The main contribution of this study lies in forming new RLV landing guidance problems to get an optimal trajectory and transforming the corresponding nonconvex problem into a convex optimization problem by introducing appropriate combinations for convexification techniques. Additionally, this paper introduces several practical constraints, such as the maximum slew rate of aerodynamic control fins and nozzle angles, which are not considered in previous works. In this paper, the performance of the proposed method with the potential for online computation is investigated through numerical simulations.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.