|국가/구분||United States(US) Patent 등록|
|미국특허분류(USC)||701/013 ; 244/164 ; 244/169 ; 244/171 ; 244/172 ; 244/158R ; 701/003 ; 701/004 ; 701/226|
|§371/§102 date||20000106 (20000106)|
|발명자 / 주소|
|출원인 / 주소|
|대리인 / 주소||
|인용정보||피인용 횟수 : 8 인용 특허 : 4|
A method for the on the whole minimum-fuel, computer-assisted control of an optionally determined number of thrusters, arranged as desired on a spacecraft, is to be specified, which method solves this linear optimization problem within the shortest possible time by reducing the computation expenditure. The method depends on the dual simplex algorithm and a suitably provided dual permissible start table. The dual permissible start table is set up on the basis of a previously computed optimum table and the transformation of the actual forces-moments vector...
[What is claimed is:] [1.]a minimum-fuel control vector (k.sub.opt) with exclusively non-negative control values for all specified thrusters is formed with the aid of the dual simplex algorithm;for this, a thruster selection identification number (I) is assigned to each thruster selection from the total number of thrusters on the spacecraft, which represents the optimum thruster selection for the minimum-fuel realization of an optional command vector (b.sub.com);for the determination of the optimum control, the command vector ((b.sub.com), which includes...