Share Email Print

Proceedings Paper

Research on allocation efficiency of the daisy chain allocation algorithm
Author(s): Jingping Shi; Weiguo Zhang
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

With the improvement of the aircraft performance in reliability, maneuverability and survivability, the number of the control effectors increases a lot. How to distribute the three-axis moments into the control surfaces reasonably becomes an important problem. Daisy chain method is simple and easy to be carried out in the design of the allocation system. But it can not solve the allocation problem for entire attainable moment subset. For the lateral-directional allocation problem, the allocation efficiency of the daisy chain can be directly measured by the area of its subset of attainable moments. Because of the non-linear allocation characteristic, the subset of attainable moments of daisy-chain method is a complex non-convex polygon, and it is difficult to solve directly. By analyzing the two-dimensional allocation problems with a “micro-element” idea, a numerical calculation algorithm is proposed to compute the area of the non-convex polygon. In order to improve the allocation efficiency of the algorithm, a genetic algorithm with the allocation efficiency chosen as the fitness function is proposed to find the best pseudo-inverse matrix.

Paper Details

Date Published: 14 March 2013
PDF: 8 pages
Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 87681I (14 March 2013); doi: 10.1117/12.2010772
Show Author Affiliations
Jingping Shi, Northwestern Polytechnical Univ. (China)
Weiguo Zhang, Northwestern Polytechnical Univ. (China)

Published in SPIE Proceedings Vol. 8768:
International Conference on Graphic and Image Processing (ICGIP 2012)
Zeng Zhu, Editor(s)

© SPIE. Terms of Use
Back to Top