Abstract
Under the Air Force sponsored Reconfigurable Systems for Tailless Fighter Aircraft - program, Boeing Phantom Works developed multiple control allocation algorithms based on linear programming and quadratic programming. According to the comparison analyses performed by the Boeing RESTORE program, the linear programming approach produced the best results in terms of maximum attainable moment space and chatter, but at the expense of increased computational time. The quadratic programming approach, on the other hand, reduced computational time but achieved less in maximum attainable moment space. Based on these observations, a study on control allocation problem was conducted using the Boeing-in-house LI optimization code, which is similar to simplex method of linear programming. The objective of this study is to evaluate the performance of the LI optimization code when applied to control allocation problem, and make assessment toward implementation. The Tailless Advanced Fighter Aircraft (TAFA) model along with its baseline control laws is used as a test bed. The assessment is made by comparisons between the LI optimization and quadratic programming in performance and execution.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
