Improvement of strapdown inertial navigation using PDAF

A new application of PDAF (probabilistic data association filter) for improving the accuracy of autonomous strapdown inertial navigation systems (SINS) is presented. The proposed method is a terrain-aided navigation (TAN) algorithm based on landmark detection combined with a classical SINS. It is shown via a set of simulations that the method can improve significantly the precision of autonomous navigation if the landmark spatial density and quality of landmark detectors are good enough. This new concept of navigation called PDANF (probabilistic data association navigation filter) can be integrated with a relatively low cost in existing operational TAN systems     

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     

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     

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

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

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     

An interior point linear programming approach to two-scan dataassociation

We present an efficient two-scan data association method (TSDA) based on an interior point linear programming (LP) approach. In this approach, the TSDA problem is first formulated as a 3-dimensional assignment problem, and then relaxed to a linear program; the latter is subsequently solved by the highly efficient homogeneous, self-dual interior point LP algorithm. When the LP algorithm generates a fractional optimal solution, we use a technique similar to the joint probabilistic data association method (JPDA) to compute a weighted average of the resulting fractional assignments, and use it to update the states of the existing tracks generated by Kalman filters. Unlike the traditional single scan JPDA method, our TSDA method provides an explicit mechanism for track initiation. Extensive computer simulations have demonstrated that the new TSDA method is not only far more efficient in terms of low computational complexity, but also considerably more accurate than the existing single-scan JPDA method     

STOCHASTIC NEURAL NETWORK AND ITS APPLICATION TO MULTI－MANEUVERING TARGET TRACKING

ＳＴＯＣＨＡＳＴＩＣＮＥＵＲＡＬＮＥＴＷＯＲＫＡＮＤＩＴＳＡＰＰＬＩＣＡＴＩＯＮＴＯＭＵＬＴＩ－ＭＡＮＥＵＶＥＲＩＮＧＴＡＲＧＥＴＴＲＡＣＫＩＮＧＪｉｎｇＺｈｏｎｇｌｉａｎｇ；ＤａｉＧｕａｎｚｈｏｎｇ；ＴｏｎｇＭｉｎｇａｎ；ＺｈｏｕＨｏｎｇｒｅｎ（Ｄ...     

SEQUENTIAL ALGORITHM FOR MULTISENSOR PROBABILISTIC DATA ASSOCIATION

Jointprobabillsticdataassociation(JPDA)isanalgorithmusedinsinglesensormultipletargettrackingsystems.Itemploysthenon-uniqueassignmentof"allneighbor"strategytoadaptforthedensemultitargettrackingenvironments[1].Becauseofitswideapplications,itisnecessarytoextendJPDAintosomemultiplesensortrackingsystems.Suchamultisensorsystem,forexample,canbeformedbycollocatingradarandinfraredsearchandtrack(IRST)whichcantakeadvantagesofboththesensorsbodatafusion.Undertheconditionofthesamesensors,acommonmeasure…     

空间多分辨率模糊目标跟踪

提出了一种新的模糊目标跟踪算法--CPDA算法。这个算法在空间多分辨率框架下应用概率数据互联算法,在粗分辨率上实现模糊目标跟踪。在不同虚警密度的模糊目标环境下,利用仿真实验分析了CPDA算法的跟踪性能,同时将其与单分辨率上的联合概率数据互联方法进行了性能比较。仿真结果表明,CPDA算法的跟踪性能在达到与单分辨率上JPDA算法同样性能的条件下,能够以较小的计算量跟踪模糊目标。     

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

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

修正的概率数据互联算法

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

基于联邦滤波的惯导/北斗/里程计紧 组合导航算法研究

针对地面载体长时间复杂应用环境对导航系统精确性和可靠性的要求,提 出一种基于联邦滤波器的惯导/北斗/里程计紧组合导航算法。在分析惯导、北斗、里程 计导航系统特点的基础上,建立了组合导航系统的误差状态模型和量测模型,采用联邦 滤波器实现了三者的紧组合容错系统设计,分别对子系统无故障、北斗及里程计出现故 障情况下进行仿真验证。结果表明,将联邦滤波理论应用于惯导/北斗/里程计紧组合导 航系统可以提高导航性能和系统的容错能力。     

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     

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     

Suboptimal joint probabilistic data association

A significant 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 terminate. Prior methods for this data association problem include various optimal and suboptimal two-dimensional assignment algorithms which make hit-to-track associations. Another method is to assign a weight for the reasonable hits and use a weighted centroid of those hits to update the track. The method of weighting the hits is known as joint probabilistic data association (JPDA). The authors review the JPDA approach and a simple ad hoc approximation and then introduce a new suboptimal JPDA algorithm. Examples which compare an optimal two-dimensional assignment algorithm with the ad hoc and the new suboptimal JPDA formulation are given     

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.     

一种基于可观测度分析的SINS/GPS自适应反馈校正滤波新方法

 针对机载捷联惯导系统(SINS)/全球定位系统（GPS）组合导航系统不完全可观测导致滤波器精度下降甚至发散的问题,提出了一种基于系统状态可观测度分析的自适应反馈校正滤波新方法。该滤波方法改进了系统可观测度的归一化处理方法,将归一化处理后的系统状态可观测度作为反馈因子,对SINS系统进行自适应反馈校正。最后,将该方法应用于机载合成孔径雷达(SAR)运动补偿用SINS/GPS组合导航系统中,飞行试验结果表明该方法在系统不完全可观测的情况下有效地提高了导航精度。     

Dynamically adaptable m-best 2-D assignment algorithm andmultilevel parallelization

In recent years, there has been considerable interest within the tracking community in an approach to data association based on the m-best two-dimensional (2D) assignment algorithm. Much of the interest has been spurred by its ability to provide various efficient data association solutions, including joint probabilistic data association (JPDA) and multiple hypothesis tracking (MHT). The focus of this work is to describe several recent improvements to the m-best 2D assignment algorithm. One improvement is to utilize a nonintrusive 2D assignment algorithm switching mechanism, based on a problem sparsity threshold. Dynamic switching between two different 2D assignment algorithms, highly suited for sparse and dense problems, respectively, enables more efficient solutions to the numerous 2D assignment problems generated in the m-best 2D assignment framework. Another improvement is to utilize a multilevel parallelization enabling many independent and highly parallelizable tasks to be executed concurrently, including 1) solving the multiple 2D assignment problems via a parallelization of the m-best partitioning task, and 2) calculating the numerous gating tests, state estimates, covariance calculations, and likelihood function evaluations (used as cost coefficients in the 2D assignment problem) via a parallelization of the data association interface task. Using both simulated data and an air traffic surveillance (ATS) problem based on data from two Federal Aviation Administration (FAA) air traffic control radars, we demonstrate that efficient solutions to the data association problem are obtainable using our improvements in the m-best 2D assignment algorithm     

基于对偶四元数的INS/GPS组合导航算法研究

在基于对偶四元数的捷联惯导解算方法的基础上,推导了以惯性系作为导航系的惯导误差方程,在此基础上设计了卡尔曼滤波组合导航算法。通过激光惯导跑车采集数据,进行了仿真分析,试验结果表明,该组合导航算法能有效的消除惯导累积的速度误差和位置误差,相比于目前广泛应用的INS/GPS组合导航算法,本文描述了INS/GPS组合导航的另一种实现方式,获得了相当的精度,具有一定的工程应用价值。     

基于随机有限集的空间碎片群运动状态估计

传统的空间目标监测是建立在单目标状态估计基础之上,在面对突发产生的大量空间碎片时,由于碎片尺寸小,且密集分布以"群"的方式出现,传统单目标处理方法很难奏效。以"群"整体作为处理对象,基于随机有限集(RFS)技术,对"群"的状态特征进行估计。为了解决漏检目标密度分配问题和轨迹关联问题,提出一种面向量测的改进集势概率假设密度(CPHD)滤波器,并结合滤波后的信息处理过程,完成了对低轨空间碎片群的目标密度分布、群内目标数以及群内显著目标的状态估计。在仿真实验中,提出的滤波器表现明显优于传统滤波器和标准CPHD滤波器,且在某些传统滤波器和标准CPHD滤波器已失效的情况下,所提技术仍能有效工作。