摘要
针对多操纵面受限控制分配问题,提出了一种新的直接分配算法———平行边搜索法。该算法通过坐标变换和投影,将n(n≥3)维目标的受限控制分配问题转化为若干2维目标的受限控制分配问题,在大大降低了计算复杂度的同时,也改进了其它直接分配算法只能分配3维目标的缺陷。此外,新算法还放宽了控制效率矩阵中任意n列向量都线性无关的条件,并且对于所有情况都能得到最优解。经仿真验证,新算法与其它控制分配算法相比,具有更小的计算复杂度和分配误差,能够满足实时性和精确性的要求。
This paper presents a new direct allocation algorithm named parallel edges searching algorithm for the solution of the multiple constrained control allocation problem. By coordinate transformation and projection, the algorithm transforms the n-dimensional objective （n ≥ 3 ） constrained control allocation problem into some two-di- mensional objective constrained control allocation problems, and greatly reduces computational complexity as well as improves the limitation of other direct allocation algorithms which can only allocate 3-dimensional objective. In addition, the algorithm relaxes the restriction that any n columns of the controls effectiveness matrix are linearly in- dependent, and returns optimal solution for any case. By simulation, the new algorithm has smaller computational complexity and distribution error compared with other control allocation algorithms and can meet the real-time and accuracy requirements.
出处
《飞行力学》
CSCD
北大核心
2012年第5期422-427,共6页
Flight Dynamics
基金
国家自然科学基金资助(91016017)
关键词
计算复杂度
可达力矩集
控制分配
飞行控制
computational complexity
attainable moments set
control allocation
flight control
