| タイトル | Accommodation of practical constraints by a linear programming jet select |
| 著者（英） | Weiler, P.; Bergmann, E. |
| 著者所属（英） | Draper (Charles Stark) Lab., Inc. |
| 発行日 | 1983-01-01 |
| 言語 | eng |
| 内容記述 | An experimental spacecraft control system will be incorporated into the Space Shuttle flight software and exercised during a forthcoming mission to evaluate its performance and handling qualities. The control system incorporates a 'phase space' control law to generate rate change requests and a linear programming jet select to compute jet firings. Posed as a linear programming problem, jet selection must represent the rate change request as a linear combination of jet acceleration vectors where the coefficients are the jet firing times, while minimizing the fuel expended in satisfying that request. This problem is solved in real time using a revised Simplex algorithm. In order to implement the jet selection algorithm in the Shuttle flight control computer, it was modified to accommodate certain practical features of the Shuttle such as limited computer throughput, lengthy firing times, and a large number of control jets. To the authors' knowledge, this is the first such application of linear programming. It was made possible by careful consideration of the jet selection problem in terms of the properties of linear programming and the Simplex algorithm. These modifications to the jet select algorithm may by useful for the design of reaction controlled spacecraft. |
| NASA分類 | SPACECRAFT DESIGN, TESTING AND PERFORMANCE |
| レポートNO | 83A41693
AIAA PAPER 83-2209 |
| 権利 | Copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/403063 |
|
