Pseudo-spectrum convexity method for dynamic constraint of last-stage online planning of carrier rocket

• Main Authors: ZHOU DING, WANG JINGBO, ZHU LIANGCONG, QIU WEI, LIANG JIANGUO, HAO CHUANCHUAN, CHEN ERKANG, SHI HUITAO, LIANG YANQIAN, ZHU FEIXIANG
• Format: Patent
• Language: Chinese; English
• Published: 21.07.2023
• Subjects: CONTROL OR REGULATING SYSTEMS IN GENERAL; CONTROLLING; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS ORELEMENTS; PHYSICS; REGULATING

The invention discloses a carrier rocket last-stage online planning dynamic constraint pseudo-spectrum convexity method. The method comprises the following steps: step 1, establishing a dynamic constraint model for carrier rocket last-stage rising vacuum section trajectory planning; step 2, performing control-affine transformation on the trajectory planning dynamics constraint; 3, obtaining a pseudo-spectrum differential matrix for discrete transformation of the kinetic equation; step 4, performing convex approximation processing on a nonlinear gravitational acceleration term in the dynamic constraint; step 5, obtaining an online trajectory planning discrete dynamic constraint in a pseudo-spectral convexity form; and step 6, carrying out dimensionless processing on the online trajectory planning discrete dynamics constraint of the pseudo-spectral convexity. Based on the pseudo-spectrum discrete principle and the convex optimization theory of the differential form, trajectory planning can have high discrete pr