It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
The design of control mixing algorithms for launch vehicles with multiple vectoring engines yields competing objectives for which no straightforward solution approach exists. The designer seeks to optimally allocate the effector degrees of freedom such that maneuvering capability is maximized subject to constraints on available control authority. In the present application, such algorithms are generally restricted to linear transformations so as to minimize adverse control-structure interaction and maintain compatibility with industry-standard methods for control gain design and stability analysis. Based on the application of the theory of ellipsoids, a complete, scalable, and extensible framework is developed to effect rapid analysis of launch vehicle capability. Furthermore, a control allocation scheme is proposed that simultaneously balances attainment of the maximum maneuvering capability with rejection of internal loads and performance losses resulting from thrust vectoring in the null region of the admissible controls. This novel approach leverages an optimal parametrization of the weighted least squares generalized inverse and exploits the analytic properties of the constraint geometry so as to enable recovery of more than ninety percent of the theoretical capability while maintaining linearity over the majority of the attainable set.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer