杂波环境下基于数据压缩的多传感器容积滤波算法

针对杂波环境下非线性系统中多传感器多目标跟踪问题,基于广义多维分配(S-D分配)规则获取最佳的量测划分,通过多传感器数据压缩技术得到等效量测点与等效量测协方差,结合容积卡尔曼滤波原理实现多目标跟踪,提出了一种基于数据压缩的多传感器容积滤波算法(SD-DCCKF)。仿真结果表明:相对已有算法,SDDCCKF不仅避免了因模型线性化误差导致的滤波发散问题,而且克服了算法在高维系统中数值不稳定的缺点,算法估计精度较高,收敛速度较快,能够更加有效地解决非线性系统中的多目标跟踪问题。     

神经网络在广义经典分配问题中的应用

在两节点分布式多传感器系统中,一些航迹关联算法可以化为广义经典分配问题。广义经典分配问题是一个组合优化问题。当目标数目较多时,很难得到问题的最优解,而且其计算量容易呈现指数爆炸现象。文章提出了用Hopfield神经网络和平均场网络解决此问题的方法。仿真结果表明,采用文章提出的人工神经网络模型求解广义经典分配问题,不仅使航迹关联具有较高的关联正确率,而且计算时间不会出现指数爆炸现象。仿真结果还表明,平均场网络相比Hopfield神经网络更易于得到问题的最优解。     

基于多信息加权融合的降维航迹关联算法

针对分布式3个传感器多目标的航迹相关算法如果直接计算时间和花费都比较高这一问题,提出降维航迹关联算法。该算法先利用2个传感器的目标位置估计点构造航迹相关代价矩阵,求出最优解,再利用这个最优解与第3个传感器的目标位置估计点构建航迹相关代价矩阵,进一步得到三维航迹相关配对。针对单信息系统不稳定这一问题,提出了融合多个特征信息的加权算法。该算法利用熵权法赋予各种不同信息的权重进行加权融合,转化为单信息问题。仿真结果说明本文所给出的新算法不仅减小了目标跟踪误差而且其时间花费较少,因此,新算法是可行的。     

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

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

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

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

基于Pareto集与多目标决策的飞控参数优化

针对传统的单目标优化方法不能对飞控系统多个性能指标同时进行优化的问题,提出了一种基于Pareto遗传算法和多目标决策的飞控系统参数优化方法。通过NSGA-Ⅱ算法对飞控系统参数进行优化获得最优解集,在此基础上首先进行方案的初选,然后利用综合权重的Vague集决策方法对备选方案进行模糊评价和优选,找到最终满意解。仿真结果验证了所设计方法的有效性。     

基于分解策略的SSO发射轨道遗传全局优化设计

提出了基于轨道分解优化和遗传算法（GA）的SSO发射轨道优化设计策略。针对多个轨道段相互耦合问题,基于分解优化策略,将整个发射轨道设计问题分解为两个轨道段设计问题。为了高效可靠地获得全局最优解,对基本遗传算法进行了改进。首先提出了基于多变异操作等改进措施的改进遗传算法;此外,结合遗传算法的全局搜索特性和Powell算法的局部搜索特性,设计了一种串行混合遗传算法。一个二级SSO运载火箭的计算结果表明,轨道分解优化策略确保了问题的成功求解,改进遗传算法和混合遗传算法均可稳定地获得全局最优解,但是混合算法更有效地提高了GA性能。     

GPS的多尺度滤波算法研究

将基于模型的GPS动态系统分析方法与基于统计特性的多尺度信号变换方法相结合,在某一尺度上给定的单传感器单模型动态系统中建立起一个新的多尺度动态模型。基于建立的多尺度模型和常规Kalman滤波,提出一个能同时对随机信号进行多尺度分解与多尺度估计的新算法,并通过Haar小波仿真试验获得了比仅利用Kalman滤波更好的估计效...     

基于自适应遗传算法的航迹关联模型

如何解决关联过程巾产生的多维分配问题,是研究多节点航迹关联的关键。遗传算法能够很好地解决组合优化问题。但是基本遗传算法具有收敛速度慢和易于早熟等缺点,对于计算航迹关联问题来说实时性较差。文章在利用遗传算法解决航迹关联问题算法的基础上进行了改进,提出了自适应策略。仿真试验表明,该模型能够使航迹关联保持较高的正确关联率和较快的计算速度。     

舰艇编队防空火力分配问题的改进遗传算法

在建立舰艇编队防空火力分配模型的基础上,设计了求解该问题的改进遗传算法。实验结果表明,该算法可以有效求得舰艇编队防空火力分配问题的最优解或近似最优解,是求解舰艇编队防空火力分配问题的一个较好的方案。     

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     

Fast data association using multidimensional assignment withclustering

We present a fast data association technique based on clustering and multidimensional assignment algorithms for multisensor-multitarget tracking Assignment-based methods have been shown to be very effective for data association. Multidimensional assignment for data association is an NP-hard problem and various near-optimal modifications with (pseudo-)polynomial complexity have been proposed. In multidimensional assignment, candidate assignment tree building consumes about 95% of the time. We present the development of a fast data association algorithm, which partitions the problem into smaller sub-problems. A clustering approach, which attempts to group measurements before forming the candidate tree, is developed for various target-sensor configurations. Simulation results show significant computational savings over the standard multidimensional assignment approach without clustering     

Multiassignment for tracking a large number of overlapping objects[and application to fibroblast cells]

In this paper we present a new technique for data association using multiassignment for tracking a large number of closely spaced (and overlapping) objects. The algorithm is illustrated on a biomedical problem, namely the tracking of a group of fibroblast (tissue) cells from an image sequence, which motivated this work. Because of their proximity to one another and due to the difficulties in segmenting the images accurately from a poor-quality image sequence, the cells are effectively closely spaced objects (CSOs). The algorithm presents a novel dichotomous, iterated approach to multiassignment using successive one-to-one assignments of decreasing size with modified costs. The cost functions, which are adjusted depending on the “depth” of the current assignment level and on the tracking results, are derived. The resulting assignments are used to form, maintain and terminate tracks with a modified version of the probabilistic data association (PDA) filter, which can handle the contention for a single measurement among multiple tracks in addition to the association of multiple measurements to a single track. Estimation results are given and compared with those of the standard 2D one-to-one assignment algorithm. It is shown that iterated multiassignment results in superior measurement-to-track association. The algorithms presented can be used for other general tracking problems, including dense air traffic surveillance and control     

Efficient multisensor fusion using multidimensional dataassociation

We present the development of a multisensor fusion algorithm using multidimensional data association for multitarget tracking. The work is motivated by a large scale surveillance problem, where observations from multiple asynchronous sensors with time-varying sampling intervals (electronically scanned array (ESA) radars) are used for centralized fusion. The combination of multisensor fusion with multidimensional assignment is done so as to maximize the “time-depth” in addition to “sensor-width” for the number S of lists handled by the assignment algorithm. The standard procedure, which associates measurements from the most recently arrived S-1 frames to established tracks, can have, in the case of S sensors, a time-depth of zero. A new technique, which guarantees maximum effectiveness for an S-dimensional data association (S⩾3), i.e., maximum time-depth (S-1) for each sensor without sacrificing the fusion across sensors, is presented. Using a sliding window technique (of length S), the estimates are updated after each frame of measurements. The algorithm provides a systematic approach to automatic track formation, maintenance, and termination for multitarget tracking using multisensor fusion with multidimensional assignment for data association. Estimation results are presented for simulated data for a large scale air-to-ground target tracking problem     

Tracking multiple objects with particle filtering

We address the problem of multitarget tracking (MTT) encountered in many situations in signal or image processing. We consider stochastic dynamic systems detected by observation processes. The difficulty lies in the fact that the estimation of the states requires the assignment of the observations to the multiple targets. We propose an extension of the classical particle filter where the stochastic vector of assignment is estimated by a Gibbs sampler. This algorithm is used to estimate the trajectories of multiple targets from their noisy bearings, thus showing its ability to solve the data association problem. Moreover this algorithm is easily extended to multireceiver observations where the receivers can produce measurements of various nature with different frequencies.     

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     

Tracking of Spawning Targets with Multiple Finite Resolution Sensors

In this paper the problem of tracking multiple spawning targets with multiple finite-resolution sensors is considered and a new algorithm for measurement-to-track association with possibly unresolved measurements is presented. The goal is to initialize new tracks of spawned targets before they are resolved from the mother platform so that one has the ability to carry out early discrimination when they become resolved. The multiple scan data association problem is first formulated as a multidimensional assignment problem with explicit new constraints for the unresolved measurements. Then the top M hypotheses tracking (TMHT) is presented where the state estimates and their covariances are modified based on the M best hypotheses through the assignment solutions. A modification to the assignment problem is developed that leads to a linear programming (LP) where the optimal solution can be a noninteger in [0,1]. The fractional optimal solution is interpreted as (pseudo) probabilities over the N - 1 frame sliding window. The best hard (binary) decision assignment solution and the M best via TMHT are compared with the soft decision solution for 2-D tracking scenarios with various sensor configurations. Based on the simulation results, the soft assignment approach has better track maintenance capability than the single best hard assignment and a performance nearly as good as the TMHT. Its computational load is slightly higher than the single best hard assignment but much lighter than TMHT.     

基于神经网络的广义经典分配航迹关联算法

在序贯航迹关联算法的基础上提出了一种广义经典分配航迹关联算法。此算法实际上是求约束条件下的函数最小值问题,属于组合优化问题,其计算复杂度随着目标数的增加而发生爆炸现象。根据Hop field神经网络模型解决此类问题的能力对此广义经典问题进行了求解。仿真实验结果表明,广义经典分配算法能够有效地解决航迹关联问题,而且用神经网络求解此问题降低了计算复杂性,并具有很高的关联正确率。     

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

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

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

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