Abstract
The complexity of the three-dimensional entry trajectory optimization problem has escalated due to the need to liberalize the angle of attack and bank angle as control variables, thereby enhancing the inherent maneuverability and control capabilities of lifting-body vehicles. The difference-of-convex (DC) properties inherent in the constraints of the problem are exploited in this paper. A DC decomposition approach is utilized to address the nonlinear auxiliary control equations, and the DC relaxation technique is applied to resolve iteration infeasibilities arising from Taylor expansion. The dependence on the initial trajectory is diminished by the implementation of an exact penalty method, thus improving the applicability of the methods. Furthermore, a control variable oscillation suppression mechanism has been constructed to tackle the control variable oscillation issues arising from the relaxation of the angle of attack and bank angle. This mechanism effectively suppresses large jumps in the angle of attack and high-frequency oscillations in the bank angle. Two novel successive DC programming methods are proposed: the successive concave-convex procedure and the successive proximal bundle method, functioning independently of trust-region constraints. Numerical experiments have demonstrated that the two proposed successive DC optimization methods exhibit exceptional performance in accuracy, feasibility, adaptability, and low sensitivity to initial values when applied to solving the three-dimensional entry trajectory optimization problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.