一种基于模糊遗传算法的多传感器多目标跟踪数据关联算法

基于模糊遗传算法发展了一种新的数据关联算法。数据关联的静态部分靠一个模糊遗传算法来得出量测组合序列和S-D分配的m个最优解。在数据关联的动态部分，将得到的S-D分配的m个最优解在一个基于多种群模糊遗传算法的动态2D分配算法中依靠一个卡尔曼滤波估计器估计出移动目标各个时刻的状态。这一基于分配的数据关联算法的仿真试验内容为被动式传感器的航迹形成和维持的问题。仿真试验的结果表明该算法在多传感器多目标跟踪中应用的可行性。另外，对算法发展和实时性问题进行了简单讨论。     

New assignment-based data association for tracking move-stop-move targets

We present a new assignment-based algorithm for data association in tracking ground targets employing evasive move-stop-move maneuvers using ground moving target indicator (GMTI) reports obtained from an airborne sensor. To avoid detection by the GMTI sensor, the targets deliberately stop for some time before moving again. The sensor does not detect a target when the latter's radial velocity (along the line-of-sight from the sensor) falls below a certain minimum detectable velocity (MDV). Even in the absence of move-stop-move maneuvers, the detection has a less-than-unity probability (P/sub D/<1) due to obscuration and thresholding. Then, it is of interest, when a target is not detected, to develop a systematic technique that can distinguish between lack of detection due to P/sub D/<1 and lack of detection due to a stop (or a near stop). Previously, this problem was solved using a variable structure interacting multiple model (VS-IMM) estimator with a stopped target model (VS-IMM-ST) without explicitly addressing data association. We develop a novel "two-dummy" assignment approach for move-stop-move targets that considers both the problem of data association as well as filtering. Typically, in assignment-based data association a "dummy" measurement is used to denote the nondetection event. The use of the standard single-dummy assignment, which does not handle move-stop-move motion explicitly, can result in broken tracks. The new algorithm proposed here handles the evasive move-stop-move motion by introducing a second dummy measurement to represent nondetection due to the MDV. We also present a likelihood-ratio-based track deletion scheme for move-stop-move targets. Using this two-dummy data association algorithm, the track corresponding to a move-stop-move target is kept "alive' during missed detections both due to MDV and due to P/sub D/<1. In addition, one can obtain reductions in both rms estimation errors as well as the total number of track breakages.     

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     

多目标跟踪的概率假设密度粒子滤波

在多目标跟踪中,当目标数很大时,目标状态的联合分布的计算量会非常大。如果目标独立运动,可用各目标分别滤波来代替,但这要求考虑数据互联问题。文章介绍一种可以解决计算量问题的方法,只需计算联合分布的一阶矩——概率假设密度(PHD),PHD在任意区域S上的积分是S内目标数的期望值。因未记录目标身份,避免了数据互联问题。仿真中,传感器为被动雷达,目标观测值为距离、角度及速度时,对上述的PHD滤波进行了粒子实现,并对观测值是否相关的不同情况进行比较。PHD粒子滤波应用在非线性模型的多目标跟踪,实验结果表明,滤波可以稳健跟踪目标数为变数的情况,得到了接近真实情况的结果。     

分布式无源传感器系统多目标跟踪算法

研究了分布式无源多传感器系统多目标跟踪问题,在只有测向信息可以利用的情况下,分布式系统首先利用波门技术分别对各个无源传感器角度测量数据进行关联配对和滤波;然后,将处理结果送到融合中心,在融合中心通过构造的χ2分布检验统计量进行多目标方位航迹的关联;最后,通过交叉定位和位置信息融合获得多个目标的位置信息估计,实现无源多目标跟踪。论文通过仿真分析对算法的有效性和可行性进行了验证。     

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

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

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.     

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

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

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

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

基于倾斜角的多目标测向无源定位技术

对多目标测向无源定位问题进行了研究。虽然无源观测站不同,针对同一目标的方位角和俯仰角数据也不同,但它们有共同的倾斜角。基于此,提出了基于倾斜角的多目标测向无源定位算法。该算法分别计算一组与多个目标对应的倾斜角,然后利用倾斜角最接近原则对这2组数据进行关联判断,解决多目标测向数据的关联和定位问题,并通过仿真实验,对算法的有效性和可行性进行了验证。     

Ground target tracking with variable structure IMM estimator

In this paper we present the design of a Variable Structure Interacting Multiple Model (VS-IMM) estimator for tracking groups of ground targets on constrained paths using Moving Target Indicator (MTI) reports obtained from an airborne sensor. The targets are moving along a highway, with varying obscuration due to changing terrain conditions. In addition, the roads can branch, merge or cross-the scenario represents target convoys along a realistic road network with junctions, changing terrains, etc. Some of the targets may also move in an open field. This constrained motion estimation problem is handled using an IMM estimator with varying mode sets depending on the topography, The number of models in the IMM estimator, their types and their parameters are modified adaptively, in real-time, based on the estimated position of the target and the corresponding road/visibility conditions. This topography-based variable structure mechanism eliminates the need for carrying all the possible models throughout the entire tracking period as in the standard IMM estimator, significantly improving performance and reducing computational load. Data association is handled using an assignment algorithm. The estimator is designed to handle a very large number of ground targets simultaneously. A simulated scenario consisting of over one hundred targets is used to illustrate the selection of design parameters and the operation of the tracker. Performance measures are presented to contrast the benefits of the VS-IMM estimator over the Kalman filter and the standard IMM estimator, The VS-IMM estimator is then combined with multidimensional assignment to gain “time-depth.” The additional benefit of using higher dimensional assignment algorithms for data association is also evaluated     

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.     

基于分段序列离散度的异步航迹关联算法

为解决异步不等速率航迹关联问题，提出一种基于分段序列离散度的异步航迹关联算法。定义分段混合航迹序列的离散信息度量，给出不等长航迹序列分段划分规则，通过计算离散度，利用经典分配法进行关联判定，并针对多义性问题设置二次检验环节。与传统算法相比，不需要时间对准，且具有不受噪声分布影响的特点。仿真结果表明，算法在航迹异步、传感器采样率不同等条件下均能以较高正确率稳定关联，并可有效分辨航迹交叉、分叉和合并等复杂情况，具有明显的优势。     

A Multistage Processing Algorithm for Disturbance Removal and Target Detection in Passive Bistatic Radar

The paper examines the problem of cancellation of direct signal, multipath and clutter echoes in passive bistatic radar (PBR). This problem is exacerbated as the transmitted waveform is not under control of the radar designer and the sidelobes of the ambiguity function can mask targets including those displaced in either (or both) range and Doppler from the disturbance. A novel multistage approach is developed for disturbance cancellation and target detection based on projections of the received signal in a subspace orthogonal to both the disturbance and previously detected targets. The resulting algorithm is shown to be effective against typical simulated scenarios with a limited number of stages, and a version with computational savings is also introduced. Finally its effectiveness is demonstrated with the application to real data acquired with an experimental VHF PBR system.     

平均场网络在航迹关联中的应用

在多节点分布式多传感器融合系统中,航迹关联问题可以化为多维分配问题。多维分配问题是一个典型的组合优化问题,很难得到问题的最优解,而且其计算量会随着问题维数和目标数的增加容易呈现指数爆炸现象。在二维平均场人工神经网络的基础上提出了一种三维平均场网络模型用于解决此三维分配问题。仿真结果表明,该人工神经网络模型,能够有效解决多维分配问题,具有较高的关联正确率,当目标数不是很多时,可满足工程上的要求。另外,提出的三维网络模型可以推广到多维情况用于解决多维分配问题。     

Cooperative task assignment of multiple heterogeneous unmanned aerial vehicles using a modified genetic algorithm with multi-type genes

The task assignment problem of multiple heterogeneous unmanned aerial vehicles （UAVs）, concerned with cooperative decision making and control, is studied in this paper. The heterogeneous vehicles have different operational capabilities and kinematic constraints, and carry limited resources （e.g., weapons） onboard. They are designated to perform multiple consecutive tasks cooperatively on multiple ground targets. The problem becomes much more complicated because of these terms of heterogeneity. In order to tackle the challenge, we modify the former genetic algorithm with multi-type genes to stochastically search a best solution. Genes of chromo- somes are different, and they are assorted into several types according to the tasks that must be performed on targets. Different types of genes are processed specifically in the improved genetic operators including initialization, crossover, and mutation. We also present a mirror representation of vehicles to deal with the limited resource constraint. Feasible chromosomes that vehicles could perform tasks using their limited resources under the assignment are created and evolved by genetic operators. The effect of the proposed algorithm is demonstrated in numerical simulations. The results show that it effectively provides good feasible solutions and finds an optimal one.     

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 with classification-aided multiframe data association

In most conventional tracking systems, only the target kinematic information from, for example, a radar or sonar or an electro-optical sensor, is used in measurement-to-track association. Target class information, which is typically used in postprocessing, can also be used to improve data association to give better tracking accuracy. The use of target class information in data association can improve discrimination by yielding purer tracks and preserving their continuity. In this paper, we present the simultaneous use of target classification information and target kinematic information for target tracking. The approach presented integrates target class information into the data association process using the 2-D (one track list and one measurement list) as well as multiframe (one track list and multiple measurement lists) assignments. The multiframe association likelihood is developed to include the classification results based on the "confusion matrix" that specifies the accuracy of the target classifier. The objective is to improve association results using class information when the kinematic likelihoods are similar for different targets, i.e., there is ambiguity in using kinematic information alone. Performance comparisons with and without the use of class information in data association are presented on a ground target tracking problem. Simulation results quantify the benefits of classification-aided data association for improved target tracking, especially in the presence of association uncertainty in the kinematic measurements. Also, the benefit of 5-D (or multiframe) association versus 2-D association is investigated for different quality classifiers. The main contribution of this paper is the development of the methodology to incorporate exactly the classification information into multidimensional (multiframe) association.     

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