某型航空发动机叶片逆向工程方法研究

以某航空发动机叶片为研究对象,结合叶片的曲面特征,使用三坐标测量机逆向工程采集点云数据;提出了适合于叶片曲面的最小二乘滤波降噪算法,应用滤波算法对点云数据进行降噪处理,并使用ImageWare软件完成数据的曲线曲面重构;最后从曲面质量和拟合精度两方面,分析和评价了叶片逆向工程的精度可靠性。     

基于PTE的多雷达航迹融合算法

针对杂波背景下的多雷达航迹融合时局部估计误差互协方差矩阵未知的问题,提出基于目标存在概率（PTE）的航迹融合算法,提升了正确航迹率和跟踪精度。首先,通过综合概率数据关联得到单接收站的目标航迹估计集合和对应的目标存在概率。然后,在局部估计误差互协方差矩阵未知的条件下,基于PTE信息提出不带记忆的综合广义凸组合航迹融合算法。进而将前一帧的融合状态进行反馈,提出带记忆的综合广义凸组合航迹融合算法。仿真验证了所提算法的有效性。     

基于单纯B样条的航空发动机机载稳态模型研究

为了减小航空发动机稳态建模的模型误差、降低复杂度及提升其实时性,提出了一种基于单纯B样条函数的航空发动机稳态模型建模方法。该函数是局部多项式基函数的线性组合,因此求解该函数为线性回归问题,通过运用广义最小二乘方法来求解B系数,从而提高计算效率和提高模型精度。最后建立了基于该算法的二维和四维涡扇发动机稳态模型,并分别与相同建模样本条件下的多输入多输出约简迭代最小二乘支持向量机稳态模型进行了比较,表明了单纯B样条建模方法不仅继承了B样条的算法复杂度低、存储数据量小和实时性好等优点,同时避免了最小二乘支持向量回归机不能拟合大样本数据的缺点,且拟合效果优于最小二乘支持向量机。     

基于一致关联数最大化的航迹关联算法

航迹关联(TTTA)是多传感器数据融合系统的核心模块之一,是系统误差估计和航迹融合的前提和基础。传感器存在的固有系统误差使得目标位置状态估计与真值发生偏离,容易诱发TTTA错误。传统的基于全局最小距离准则的TTTA算法,需要获得较高精度的系统误差估计,来对航迹数据进行误差补偿。针对传感器具有系统误差环境下的TTTA问题,在对TTTA进行间接评估的基础上,定义了一致关联数的概念,提出了一致关联数最大化的TTTA准则,并在稳健交替迭代的框架下完成算法设计。与距离函数不同,一致关联数是一个离散量,放松了对系统误差估计精度的要求。最后,仿真实验验证了所提算法的有效性。     

基于序贯关联算法的多目标无源跟踪

基于序贯关联算法,对多目标无源跟踪问题进行了研究。在只有角度信息可以利用的情况下,首先,利用波门技术对各个无源传感器角度测量数据进行关联和滤波,形成参数航迹;然后,将各个无源传感器的参数航迹送到融合中心进行关联配对,并在关联过程中通过构造关联质量函数对参数航迹的关联历史情况进行度量,解决参数航迹关联模糊问题;最后,通过对关联成功的参数航迹进行交叉定位,给出多个不同目标的位置信息,实现分布式无源系统对多目标的数据关联和跟踪,并通过仿真分析,对算法的有效性和可行性进行验证。     

基于雷达航迹的航空器质量估算

为保障基于轨迹运行的顺利实施,必须提高四维航迹预测的精度,而四维航迹的精准预测依赖于航空器质量准确估算。鉴于此,构建并分析了航空器能量模型;基于雷达航迹与航空器基础资料( BADA),提出了新型的航空器质量估算方法与步骤;利用最小二乘算法求解了航空器质量的估计值;分别基于预测航迹、雷达轨迹与QAR数据,采用相对误差作为评价指标,实施验证与分析。验证结果表明,提出的方法可将航空器质量估算误差控制在5%以内,从而能够有效地提高航迹预测精度。     

基于卡尔曼滤波的数据融合技术在系统航迹中的研究与应用

本文针对空中交通管制自动化系统输出的系统航迹在边界地区出现多重目标和跳跃点的问题,提出了一种对系统航迹进行二次融合的方法,建立了状态方程和测量方程,提出了一种自适应扩展卡尔曼滤波的跟踪算法.将系统航迹传输时延转换为空中目标的距离,用卡尔曼滤波方法对数据中的噪声进行滤波.对目标的匀速航行和机动航行进行了仿真实验,实验结果表明了该算法的正确性和有效性.最后将该算法用于系统航迹中,也取得了良好的效果.     

基于模板匹配的集中式多传感器群内目标精细跟踪算法

为解决多传感器探测下群内目标精细跟踪的难题,基于非机动情况下各探测周期内群内目标真实回波位置相对固定的特性,提出了一种基于模板匹配的集中式多传感器群内目标精细跟踪算法。该算法通过预关联成功的群状态集合与群量测集合分别建立模板形状矩阵和待匹配形状矩阵,利用匹配搜索模型和匹配矩阵确认规则选出代价最小的匹配矩阵,并基于模板和对应的匹配矩阵利用 kalman滤波完成群内各目标航迹的状态更新。仿真表明,与传统多传感器多目标跟踪算法中性能优越的基于数据压缩的集中式多传感器多假设算法相比,该算法在跟踪精度、实时性、有效跟踪率方面的性能明显优越,能很好的满足群内目标精细跟踪的实际工程需求。     

基于变角度积分的六自由度弹道快速解算方法

针对传统时间积分方式解算弹道难以兼顾效率与精度的要求,插值拟合法则需要耗费大量存储空间,且精度差,提出了基于角度积分的普通航弹六自由度弹道方程,利用变角度的方式,可以快速地获得弹道解算结果。在Vx Works5.5环境下进行了算例测试,验证了算法的性能良好,该方法能够满足精度与实时性的要求,适用于航空电子系统机载火控任务软件设计。     

基于EKF的小型涵道式无人机航姿系统算法研究

针对小型涵道式无人机,设计了一种基于扩展Kalman滤波的航姿估计算法。采用四元数作为状态变量,利用陀螺仪的输出构成状态方程,通过加速度计与磁阻传感器构造观测方程来进行扩展Kalman滤波解算。相对于通常的航姿估计算法,这种算法减少了运算量,更适合于基于嵌入式微处理器的航姿估计。实验结果表明这种算法有效的抑制了航姿系统的各种噪声与干扰,同时保证了姿态输出的精度与实时性,可以为小型无人机提供准确的航姿信息。     

单天基平台测向的空间非合作目标跟踪

针对仅含角度测量信息的单个天基平台可观测性较弱的问题,提出了一种含脉冲机动检测的空间非合作目标跟踪算法,并设计了非合作目标实时跟踪数据处理流程.该算法利用抗差估计技术和UKF（Unscented Kalman Filter,无迹卡尔曼滤波）算法构造目标跟踪滤波器,并综合残差多项式拟合和新息分布特征等方法实现目标机动检测,在天基平台观测信息类型有限和观测几何较差的情况下,可以同时排除孤立野值和成片测量野值的影响,实现非合作机动目标的连续稳定跟踪.数值实验验证了算法的可行性和有效性,也表明了跟踪精度和可靠性与测量精度密切相关.     

Tracking in clutter with nearest neighbor filters: analysis andperformance

The measurement that is “closest” to the predicted target measurement is known as the “nearest neighbor” (NN) measurement in tracking. A common method currently in wide use for tracking in clutter is the so-called NN filter, which uses only the NN measurement as if it were the true one. The purpose of this work is two fold. First, the following theoretical results are derived: the a priori probabilities of all three data association events (updates with correct measurement, with incorrect measurement, and no update), the probability density functions (pdfs) of the NN measurement conditioned on the association events, and the one-step-ahead prediction of the matrix mean square error (MSE) conditioned on the association events. Secondly, a technique for prediction without recourse to expensive Monte Carlo simulations of the performance of tracking in clutter with the NN filter is presented. It can quantify the dynamic process of tracking divergence as well as the steady-state performance. The technique is a new development along the line of the recently developed general approach to the performance prediction of algorithm with both continuous and discrete uncertainties     

弹性高超声速滑翔飞行器的状态/参数联合估计

弹性高超声速滑翔飞行器具有强非线性、强不确定性和刚体/弹性耦合的特点，对其状态和参数进行估计十分必要。为解决这一问题，提出了一种传感器布置策略和一种利用正交三角（QR）分解更新到达代价的滚动时域估计算法（MHE-QR）。首先，建立了考虑弹性的传感器观测模型并分析了传感器位置对可观性的影响，并在此基础上提出了一种反映系统可观性的性能指标。传感器布置策略以此性能指标为目标函数，将传感器布置问题转化为约束非线性优化问题并求解，即可得到最优传感器布置方案。然后提出了MHE-QR算法。在滚动时域估计的框架下，该算法利用前向动态规划原理将到达代价的计算转化为最小二乘问题，并给出了基于QR分解的到达代价更新算法。仿真结果表明该传感器布置策略和MHE-QR算法能够有效提高估计精度、收敛速度和计算速度。此外，MHE-QR算法具有实时应用的潜力。     

Adaptive detection threshold optimization for tracking in clutter

The adaptive optimization of detection thresholds for tracking in clutter is investigated for the probabilistic data association (PDA) filter. Earlier work on this problem by T.E. Fortmann et al. (1985) involved an approximate steady-state analysis of the state error covariance and is only suitable for time-invariant systems. Furthermore, the method requires numerous assumptions and approximations about the error covariance update equation, and uses a cumbersome graphical optimization algorithm. In this work we propose two adaptive schemes for threshold optimization, namely prior and posterior optimization algorithms which minimize the mean-square state estimation error over detection thresholds which depend on data up to the previous and current time-step, respectively. These algorithm are suitable for real-time implementation in time-varying systems. Some simulation results are presented     

基于数据关联的故障快速检测

 多数情况下,快速实时地进行故障检测是很重要的。将故障看做是通过多传感器观测的动态模型,进行多传感器多模型概率数据关联,以各个模型的关联结果和设定的阈值为依据,可以有效地实现故障检测。联合概率数据关联（JPDA）算法是解决多传感器多目标跟踪的一个有效方法,文中通过分析概率数据关联算法,对联合概率数据关联算法进行了改进：（1）通过正确地选择阈值,移除小概率事件,进而建立一个近似的确认矩阵;（2）根据被跟踪目标故障跟踪门的相交情况,将跟踪空间进行数学划分,形成若干相互独立的区域;（3）对同一区域内公共有效量测的概率密度值进行衰减,计算出关联概率。仿真对比表明,本文的改进算法能显著减少计算时间,有效提高故障检测的快速性和实时性。     

Loopy belief propagation based data association for extended target tracking

The data association problem of multiple extended target tracking is very challenging because each target may generate multiple measurements. Recently, the belief propagation based multiple target tracking algorithms with high efficiency have been a research focus. Different from the belief propagation based Extended Target tracking based on Belief Propagation (ET-BP) algorithm proposed in our previous work, a new graphical model formulation of data association for multiple extended target tracking is proposed in this paper. The proposed formulation can be solved by the Loopy Belief Propagation (LBP) algorithm. Furthermore, the simplified measurement set in the ET-BP algorithm is modified to improve tracking accuracy. Finally, experiment results show that the proposed algorithm has better performance than the ET-BP and joint probabilistic data association based on the simplified measurement set algorithms in terms of accuracy and efficiency. Additionally, the convergence of the proposed algorithm is verified in the simulations.     

A class of near optimal JPDA algorithms

The crucial problem in multiple target tracking is the hit-to-track data association. A hit is a received signal from a target or background clutter which provides positional information If an incorrect hit is associated with a track, that track could diverge and prematurely terminate or cause other tracks to also diverge. Most methods for hit-to-track data association fall into two categories: multiple hypothesis tracking (MHT) and joint probabilistic data association (JPDA). Versions of MHT use all or some reasonable hits to update a track and delay the decision on which hit was correct. JPDA uses a weighted sum of the reasonable hits to update a track. These weights are the probability that the hit originated from the target in track. The computational load for the joint probabilities increases exponentially as the number of targets increases and therefore, is not an attractive algorithm when expecting to track many targets. Reviewed here is the JPDA filter and two simple approximations of the joint probabilities which increase linearly in computational load as the number of targets increase. Then a new class of near optimal JPDA algorithms is introduced which run in polynomial time. The power of the polynomial is an input to the algorithm. This algorithm bridges the gap in computational load and accuracy between the very fast simple approximations and the efficient optimal algorithms