基于三迭代与二阶锥规划的机载MIMO雷达稳健降维STAP方法

针对机载多输入多输出(MIMO)雷达空时自适应处理(STAP)中期望目标导向矢量的失配问题,提出一种基于三迭代(TRIA)与二阶锥规划(SOCP)的稳健降维MIMO-STAP方法。首先将MIMO-STAP权矢量分解为发射、接收、多普勒3个低维权矢量的Kronecker积,然后分别限定实际发射、接收、多普勒导向矢量与假定导向矢量之间的误差范数边界,通过优化最差性能,利用SOCP对各个低维权矢量进行三迭代求解,最后进行权矢量合成。该方法在保证机载MIMO雷达获取稳健STAP性能的同时,通过三迭代降维处理,能够有效降低训练样本数需求与运算复杂度,因此更具有实际应用价值。仿真结果验证了算法的有效性。     

大气层内模型预测静态规划拦截中制导

在临近空间机动目标拦截中,拦截器的初始动力段对中制导段乃至末端拦截性能具有重要影响。在模型预测静态规划（MPSP）理论基础上提出了一种初、中制导联合规划制导方法,旨在解决多阶段、快速、最优拦截轨迹规划和制导问题。首先,提出了一种改进的模型预测静态规划方法,该方法不仅可以满足终端约束,还可以生成最优初始状态,并在性能指标中考虑状态变量相关函数。其次,基于等效阻力模型建立了包含动力段与非动力段的两段规划模型,通过采用分段离散以及构建关机点变分关系的方法,避免了内点约束的引入,使MPSP算法可直接求解该两段规划问题。最后,结合提出的MPSP算法以及两段规划模型,实现了终端速度最优的拦截轨迹规划,结合目标预测方法,实现了对机动目标的预测拦截。仿真结果表明,本文方法可提高制导精度和终端速度,且能更好满足对机动目标的拦截需求。     

基于小波尺度函数的WSK-SV算法 及其气动性能预测

提出了一种将小波的尺度函数与SV(support vector)算法相结合的WSK-SV(wavelet scaling kernel-support vector)新算法,并将Daubechies小波以及Shannon小波的尺度函数分别构成尺度核函数,而且分别作为SV算法中一个可容许的支持向量核函数使用.该算法充分利用了Daubechies小波函数的紧支集与正交等特点以及小波的MRA(multi-resolution analysis,多分辨分析),并注意了尺度核函数能够满足Mercer条件.该算法除了具有通常SVM(support vector machine)所具有的优点外,还具有很好的收敛性以及泛化能力,能够有效地提高学习与预测效率.典型算例选取了不同的小波尺度函数,数值计算表明:在一维、二维和三维问题中,这些小波的尺度函数均可以用于WSK-SV算法,进而显示了这个新算法的可行性与通用性.      

基于代理模型的机载吊舱气动与隐身一体化设计方法

考虑雷达隐身要求的机载吊舱初步设计时,存在载机-吊舱组合体RCS计算复杂度高的问题。为此,本文构造了用于计算RCS的代理模型,并基于此代理模型以吊舱横截面积、吊舱对载机的气动特性影响量和飞机与吊舱组合的RCS为优化目标,用评价函数法构造吊舱外形设计的多目标优化模型,并用复合形法求解该模型的设计参数。按该参数设计的吊舱外形能使载机在挂载吊舱后气动阻力系数与RCS增量均保持较低的水平,同时可保持吊舱较大的装载截面。研究结果表明,本方法在吊舱的初步设计阶段对设计参数的选取具有较好的指导意义。     

基于多信号流图与分支定界算法的故障诊断

针对实时在线故障诊断问题,提出了一种基于多信号流图和分支定界算法的故障诊断方法。通过建立多信号流图模型生成相关矩阵作为诊断知识,进而由相关矩阵以及观测向量产生冲突集,使最小诊断集的求解过程映射为整数规划问题;采用分支定界算法,通过对冲突集的分支、定界以及剪支得到故障诊断的最优解,从而避免了穷举问题造成的搜索"爆炸"。以某型机载燃油系统为对象对本文提出的算法进行了验证。结果表明:本文算法与常用的多信号流图诊断推理算法TEAMS-RT相比,算法速度相当,故障定位精度更高,很好地涵盖单故障以及多故障组合,可以胜任大规模复杂系统的故障诊断。      

Adaptive path planning for unmanned aerial vehicles based on bi-level programming and variable planning time interval

This paper presents an adaptive path planner for unmanned aerial vehicles (UAVs) to adapt a real-time path search procedure to variations and fluctuations of UAVs’ relevant performances, with respect to sensory capability, maneuverability, and flight velocity limit. On the basis of a novel adaptability-involved problem statement, bi-level programming (BLP) and variable planning step techniques are introduced to model the necessary path planning components and then an adaptive path planner is developed for the purpose of adaptation and optimization. Additionally, both probabilistic-risk-based obstacle avoidance and performance limits are described as path search constraints to guarantee path safety and navigability. A discrete-search-based path planning solution, embedded with four optimization strategies, is especially designed for the planner to efficiently generate optimal flight paths in complex operational spaces, within which different surface-to-air missiles (SAMs) are deployed. Simulation results in challenging and stochastic scenarios firstly demonstrate the effectiveness and efficiency of the proposed planner, and then verify its great adaptability and relative stability when planning optimal paths for a UAV with changing or fluctuating performances.     

MIDACO on MINLP space applications

A numerical study on two challenging mixed-integer non-linear programming (MINLP) space applications and their optimization with MIDACO, a recently developed general purpose optimization software, is presented. These applications are the optimal control of the ascent of a multiple-stage space launch vehicle and the space mission trajectory design from Earth to Jupiter using multiple gravity assists. Additionally, an NLP aerospace application, the optimal control of an F8 aircraft manoeuvre, is discussed and solved. In order to enhance the optimization performance of MIDACO a hybridization technique, coupling MIDACO with an SQP algorithm, is presented for two of these three applications. The numerical results show, that the applications can be solved to their best known solution (or even new best solution) in a reasonable time by the considered approach. Since using the concept of MINLP is still a novelty in the field of (aero)space engineering, the demonstrated capabilities are seen as very promising.     

一种针对冗余执行机构配置的修正直接分配算法(英文)

控制分配考虑期望控制量在冗余执行机构配置间的指令分配问题。本文基于执行机构的可达集提出一种修正直接分配新算法,重点解决该类算法的分配效率问题,并与修正伪逆再分配法、基于单纯形法求解的直接分配法线性规划模型以及次梯度优化算法进行对比分析。为减少原始直接分配法的离线计算时间,提出基于执行机构安装矩阵的零空间构建可达集信息,使离线计算时间在执行机构数目小于10时优于传统基于行空间的构建方法。在线计算中,提出基于单位可达集顶点信息寻找与期望控制量射线方向临近的可达集表面,从而缩小搜索范围、降低在线计算时间。仿真结果表明:修正算法不显著增加离线数据存储量,并将在执行机构数目小于10时至少降低32.22%的离线计算时间;在线计算中,其平均在线时间较对比算法均有大幅提高;在高度冗余控制分配问题中,修正算法将具有更大优势。