一种基于最小二乘拟合的数据关联算法

针对点航关联在多目标跟踪中精度与实时性难兼顾的问题,提出了一种基于最小二乘拟合的点航关联算法。首先采用滑窗将历史航迹截断,采用最小二乘法在不同维度分别拟合、外推融合航迹历史信息条件下的航迹点,增加外推点的多样性及信息量。同时定义了5种全概率关联事件,提取传统滤波方法的预测点,将拟合外推点与滤波预测点融合,使归属判决更加准确。最后分别推导了不同事件发生时的状态更新方程与误差协方差更新方程,给出了其中参数的确定方法。经仿真数据验证,与经典的最近邻域法和联合概率数据互联算法相比,所提算法能够更好地兼顾精度与实时性,且计算复杂度较低,易于工程实现。     

基于桶消元的数控机床故障模糊贝叶斯网络推理方法

用模糊数描述节点的多种故障状态,用模糊子集描述根节点的故障概率,用贝叶斯网络的条件概率表描述节点间的不确定关系,构建数控机床故障的模糊贝叶斯网络;采用桶消元算法,对数控机床故障的模糊贝叶斯网络进行推理和计算,获得根节点的后验概率,为数控机床故障诊断与分析提供依据;最后,以数控机床刀架系统故障的贝叶斯网络推理过程为例,验证所提理论和方法的有效性。     

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

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

贝叶斯网络在科研试飞安全风险评估中的应用

为提升直升机科研试飞安全水平,实现对试飞风险进行准确有效的评估,采用因果贝叶斯网络建立试飞安全风险评估系统。首先,根据直升机试飞的整体流程识别可能出现的风险事件并分类,通过风险因素间的内在关联构建贝叶斯网络拓扑结构;其次,结合专家调研数据,采用贝叶斯吐真剂算法确定各节点条件概率,利用因果贡献度和AgenaRisk软件进行灵敏度分析;最后,得到影响直升机科研试飞安全的关键风险事件。结果表明:利用因果贝叶斯网络建立的直升机科研试飞风险控制模型可以得到关键风险事件,依据分析得到的结果进行风险控制,可以满足试飞安全风险管理的需求。     

基于一致性预处理技术的作业车间调度算法研究

为降低CSP调度算法的计算复杂度和减少搜索过程中回溯发生概率,采用一致性预处理技术来预先修剪和过滤搜索空间。仿真实验证明:两种方法的综合运用可以显著提高CSP调度算法的搜索效率,从而为CSP调度算法求解大规模作业车间调度问题提供可能。     

航空项目资源均衡优化问题的蚁群-模拟退火算法

为有效提高复杂航空项目资源利用率、节约项目成本,提出了一种求解大规模网络计划资源均衡优化问题的蚁群-模拟退火算法。该方法中,首先采用预处理方法对航空项目分级网络计划实施合并,并结合资源指数与搭接网络关系定义建立了资源优化目标函数。然后,探讨了以网络计划为基础的蚁群-模拟退火算法解空间构建方法,给出了算法的状态转移规则、信息素更新规则,提出了增加搜索效率的模拟退火局部搜索策略,并建立了详细的资源均衡优化方案求解步骤。最后,采用典型实例验证了方法的有效性。     

基于视觉注意机制的认知雷达数据关联算法

针对传统关联波门设计方法在应用于机动目标跟踪时容易引起失跟、以及概率数据关联算法不适于多交叉目标跟踪的问题,提出了一种基于人类视觉选择性注意机制和知觉客体的"特征整合"理论的认知雷达数据关联算法。算法以综合交互式多模型概率数据关联算法为基础,采取假设目标最大机动水平已知的"当前"统计模型和匀速运动模型作为模型集,通过实时交互使关联波门能够随目标机动动态调整,较好地兼顾了雷达计算耗时和跟踪成功率。在利用目标位置特征的基础上,进一步提取、整合目标运动特征,对关联波门交叉区域公共量测进行分类,使多交叉目标跟踪问题转化为多个单目标跟踪问题,优化了传统概率数据关联算法。仿真结果表明：与传统关联波门设计方法相比,算法跟踪失败率和计算耗时明显降低;而且在计算资源增加不大的情况下,杂波环境适应性也得到了显著增强。     

多局部节点异步抗差航迹关联算法

为解决航迹异步与系统误差并存情况下的多局部节点航迹关联问题,提出一种基于区间序列离散度的多局部节点异步抗差航迹关联算法。定义区间型数据集的离散信息度量,给出系统误差下航迹序列区间化方法,通过累次积分计算离散度,结合多维分配进行关联判定。针对多局部节点上报目标不完全一致现象,设置零号航迹管理关联质量。与传统算法相比,无需时域配准,可在系统误差下对异步航迹直接关联。仿真结果表明,算法能在局部节点上报目标不完全一致场景下实现有效关联,且正确关联率随局部节点数目的增加或目标密集程度的增大而提高。     

基于贝叶斯网络的多状态机载系统安全性评估方法

传统的安全性评估方法不适用于具有多状态属性的现代机载系统。根据系统与系统组成单元之间的状态关系,构建了基于贝叶斯网络的机载系统多状态安全性模型;运用通用生成函数给出了贝叶斯网络非根节点的条件概率表,基于变量消元法提出了系统失效状态发生概率计算方法,推导了系统组成单元重要度算法。结合某型飞机副翼控制系统给出了应用实例。结果表明,方法为解决多状态机载系统的安全性评估问题提供了一种简洁直观的方法,能够有效评估机载系统的安全性水平,确定各单元对系统安全性中的影响。     

一种密集多回波环境下的机动多目标跟踪起始算法

 本文研究密集多回波环境下的机动多目标跟踪起始问题。文中首先提出主跟踪子空间和边缘跟踪子空间的定义与性质,接着修正Bayes轨迹确定方法BTC,并将其与具有残差滤波的修正概率数据关联滤波算法MPDAF-RF有机地结合起来,提出一种适合高密集多回波环境的机动多目环跟踪起始方法——“全邻”Bayes跟踪起始算法ABTI。Monte Carlo仿真表明,本文所给出的算法不仅克服了一类概率数据关联滤波方法没有跟踪起始机理的缺陷,而且辨别目标与虚警的能力很强,不失为解决高密集多回波环境下机动多目标跟踪起始的有效方法。     

Neural solution to the multitarget tracking data associationproblem

The problem of tracking multiple targets in the presence of clutter is addressed. The joint probabilistic data association (JPDA) algorithm has been previously reported to be suitable for this problem in that it makes few assumptions and can handle many targets as long as the clutter density is not very high. However, the complexity of this algorithm increases rapidly with the number of targets and returns. An approximation of the JPDA that uses an analog computational network to solve the data association problem is suggested. The problem is viewed as that of optimizing a suitably chosen energy function. Simple neural-network structures for the approximate minimization of such functions have been proposed by other researchers. The analog network used offers a significant degree of parallelism and thus can compute the association probabilities more rapidly. Computer simulations indicate the ability of the algorithm to track many targets simultaneously in the presence of moderately dense clutter     

Multiple scan joint probabilistic data association

This paper presents a multiple scan or n-scan-back joint probabilistic data association (JPDA) algorithm which addresses the problem of measurement-to-track data association in a multiple target and clutter environment. The standard single scan JPDA algorithm updates a track with weighted sum of the measurements which could have reasonably originated from the target in track. The only information the standard JPDA algorithm uses is the measurements on the present scan and the state vectors and covariance matrices of the present targets. The n-scan-back algorithm presented here uses multiple scans of measurements along with the present target information to produce better weights for data association. The standard JPDA algorithm can utilize a formidable amount of processing power and the n-scan-back version only worsens the problem. Therefore, along with the algorithm presentation, implementations which make this algorithm practical are discussed and referenced. An example is also shown for a few n-scan-back window lengths     

Evaluation of multiple radar target trackers in stressfulenvironments

This paper evaluates the performance of multiple target tracking (MTT) algorithms in real-life stressful radar tracking environments. Real closely spaced maneuver radar data, generated by six F-18 fighters and other targets, were collected jointly by the defence departments of Canada and United States to support this practical MTT algorithm evaluation study. A set of performance metrics was defined here to compare the suboptimal nearest neighbor (SNN), global nearest neighbor (GNN), and various variants of the joint probabilistic data association (JPDA) MTT trackers. Results reveal an interesting result that all these MTT algorithms exhibited very close performance. In addition, the weighted sum approach of the PDA/JPDA trackers which are theoretically effective were observed to perform poorly in tracking closely spaced targets. Overall speaking, the GNN filter based on the Munkres algorithm had the best performance in terms of both tracking performance and robustness     

密集杂波环境下的数据关联快速算法

基于联合概率数据互联（JPDA）的思想,提出了一种新的数据关联快速算法（Fast Al-gorithm for Data Association,简称FAFDA算法）.该方法不需象在最优JPDA算法中那样生成所有可能的联合互联假设,因而具有计算量小,易于工程实现的特点。仿真结果表明,与最优JPDA算法相比,FAFDA算法的跟踪性能令人满意,并且在密集杂波环境下可实时、有效地跟踪100批次以上的目标。     

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     

修正的概率数据互联算法

阐明了概率数据互联(PDA)算法能很好地解决密集环境下的目标跟踪问题,在该算法基础上,人们又提出了联合概率数据互联(JPDA)算法和一些基于 PDA 的修正算法。在概率数据互联算法中,有一个很重要的参数就是杂波数密度(或波门内虚假量测期望数)。然而在许多实际情况中,这个参数是很难获取的。针对这一问题,文中提出了一种修正的概率数据互联算法,该算法通过实时地调整这一参数来获得对目标较为准确的估计结果。最后,给出了算法的仿真分析。     

Multisensor covariance control strategies for reducing bias effects in interacting target scenarios

Algorithms are presented for managing sensor information to reduce the effects of bias when tracking interacting targets. When targets are close enough together that their measurement validation gates overlap, the measurement from one target can be confused with another. Data association algorithms such as the joint probabilistic data association (JPDA) algorithm can effectively continue to track targets under these conditions, but the target estimates may become biased. A modification of the covariance control approach for sensor management can reduce this effect. Sensors are chosen based on their ability to reduce the extent of measurement gate overlap as judged by a set of heuristic parameters derived in this work. Monte Carlo simulation results show that these are effective methods of reducing target estimate bias in the JPDA algorithm when targets are close together. An analysis of the computational demands of these algorithms shows that while they are computationally demanding, they are not prohibitively so.     

Joint probabilistic data association for autonomous navigation

A new autonomous navigation scheme based on the joint probabilistic data association (JPDA) approach that processes landmark detections in the field of view (FOV) of an on-board sensor is developed. These detections-some true, some false-are associated to a set of stored landmarks and used to update the state of the vehicle. The results obtained from Monte Carlo simulations prove the ability of this navigation filter to perform in very high false alarm environments. In the different environmental conditions tested in the simulations, the performance of the JPDA navigation filter (JPDANF) is very close to that of the filter based on perfect data association. The very efficient cluster decomposition algorithm presented for the purpose of the navigation problem can also be used in many multitarget tracking applications     

Tracking of multiple maneuvering targets using multiscan JPDA and IMM filtering

The paper considers the problem of tracking multiple maneuvering targets in the presence of clutter using switching multiple target motion models. A novel suboptimal filtering algorithm is developed by applying the basic interacting multiple model (IMM) approach and the joint probabilistic data association (JPDA) technique. Unlike the standard single-scan JPDA approach, the authors exploit a multiscan joint probabilistic data association (mscan-JPDA) approach to solve the data association problem. The algorithm is illustrated via a simulation example involving tracking of four maneuvering targets and a multiscan data window of length two