三维目标直接分配新算法

New algorithm for three-moment control direct allocation

针对三维期望控制量的控制分配问题,提出临近点搜索法,旨在提高方法的在线计算效率。该算法对原有离线计算部分进行调整,计算所有顶点在二维平面中的投影。在线计算中,首先确定期望向量相邻的顶点,再将它们按与期望向量夹角大小来排列。只需在包含相邻点的平面中进行搜索,就可以确定期望向量与目标可达集合相交的面,并进一步确定交点。仿真验证表明:算法虽会少量增加离线的存储量,但可以减少在线搜索的时间,提高算法的实时应用能力。

A new algorithm named 'adjacent vertices searching algorithm' to solve the three-objective control allocation problem and enhance the efficiency of on-line computation was proposed.This algorithm modifies the old off-line computation by calculating the projection of the vertices in two-dimensional plane.In on-line computations,the algorithm searches the vertices close with the projection of the desired vector in two-dimensional plane and sorts them by the angle between the vertex and the desired vector.By checking the facets containing the adjacent vertices,the facet intersecting with the desired vector and the intersection will be found.The simulation shows that the algorithm will add the off-line computation a little,but can reduce the searching time on-line and enhance the ability of real time application.