基于标签多伯努利滤波的衍生目标跟踪算法

针对现有随机有限集(RFS)滤波器在低信噪比环境下对衍生目标跟踪性能严重下降的问题,提出了一种基于Delta扩展标签多伯努利(δ-GLMB)滤波器的改进算法。基于随机集理论和伯努利衍生模型,推导了新的预测方程,并采用了假设裁剪及分组手段和多伯努利近似技术以降低算法的计算量。针对假设增多引起的虚警问题,将多帧平滑思想和算法相结合,利用标签信息对新目标进行回溯处理。仿真结果表明,所提算法能对目标数目进行无偏估计,在低探测概率和强杂波环境下性能明显优于概率假设密度(PHD)算法,计算开销在衍生初始阶段增长快于PHD,目标较分散时低于PHD。     

Multiple model particle flter track-before-detect for range ambiguous radar

The middle pulse repetition frequency（MPRF）and high pulse repetition frequency（HPRF）modes are widely adopted in airborne pulse Doppler（PD）radar systems,which results in the problem that the range measurement of targets is ambiguous.The existing data processing based range ambiguity resolving methods work well on the condition that the signal-to-noise ratio（SNR）is high enough.In this paper,a multiple model particle flter（MMPF）based track-beforedetect（TBD）method is proposed to address the problem of target detection and tracking with range ambiguous radar in low-SNR environment.By introducing a discrete variable that denotes whether a target is present or not and the discrete pulse interval number（PIN）as components of the target state vector,and modeling the incremental variable of the PIN as a three-state Markov chain,the proposed algorithm converts the problem of range ambiguity resolving into a hybrid state fltering problem.At last,the hybrid fltering problem is implemented by a MMPF-based TBD method in the Bayesian framework.Simulation results demonstrate that the proposed Bayesian approach can estimate target state as well as the PIN simultaneously,and succeeds in detecting and tracking weak targets with the range ambiguous radar.Simulation results also show that the performance of the proposed method is superior to that of the multiple hypothesis（MH）method in low-SNR environment.     

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.     

基于点集合并的修正Hough变换TBD算法

在低信噪比条件下,基于Hough变换的检测前跟踪算法是进行强杂波背景下目标航迹检测的一种手段。本文针对Hough变换后一个目标产生多条可能航迹以及航迹内可能存在杂波点的问题,提出了一种基于能量最大点和点集合并的修正Hough变换检测前跟踪算法。该算法利用量测点时序、能量信息及目标速度先验信息对Hough变换后点迹进行关联和剔除,能够有效的对目标原始航迹进行回溯。针对高斯噪声背景下的飞行目标,仿真结果表明该算法能够对微弱目标进行有效检测,在目标数目、杂波密度、信噪比发生变化的条件下仍能保持较高的检测概率。     

Efficient fault tolerant estimation using the IMM methodology

Space systems are characterized by a low-intensity process noise resulting from uncertain forces and moments. In many cases, their scalar measurement channels can be assumed to be independent, with one-dimensional internal dynamics. The nominal operation of these systems can be severely damaged by faults in the sensors. A natural method that can be used to yield fault tolerant estimates of such systems is the interacting multiple model (IMM) filtering algorithm, which is known to provide very accurate results. However, having been derived for a general class of systems with switching parameters, the IMM filter does not utilize the independence of the measurement errors in different channels, nor does it exploit the fact that the process noise is of low intensity. Thus, the implementation of the IMM in this case is computationally expensive. A new estimation technique is proposed herein, that explicitly utilizes the aforementioned properties. In the resulting estimation scheme separate measurement channels are handled separately, thus reducing the computational complexity. It is shown that, whereas the IMM complexity is exponential in the number of fault-prone measurements, the complexity of the proposed technique is polynomial. A simulation study involving spacecraft attitude estimation is carried out. This study shows that the proposed technique closely approximates the full-blown IMM algorithm, while requiring only a modest fraction of the computational cost.     

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     

连续短线段空间圆弧转接与插补

针对连续短线段高速加工控制需求,研究了利用空间圆弧转接实现高速插补的方法。建立了圆弧转接数学模型,研究了转接的几何约束和运动约束、转接参数计算、空间圆弧插补等相关理论与算法,并详细分析了算法的使用范围、效率制约因素和计算量等工程实现相关问题。仿真和加工实验表明:该转接算法能显著提高加工效率,减小振动,改善工件表面质量。作为空间圆弧转接算法基础的空间圆弧插补算法对空间任意平面内圆弧插补具有实用价值。本文所有算法已经在自主研发的数控平台上进行了验证,应用效果良好。     

改进的MMPHD机动目标跟踪方法

基于序列蒙特卡罗方法的经典多模概率假设密度滤波方法及其各种衍生方法,在预测过程中依据多个并行的状态转移模型,通过将大量粒子散布到下一时刻目标所有可能出现的状态空间实现目标状态的捕获,造成计算量大、目标跟踪精度差。为此,提出一种改进的多模粒子概率假设密度机动目标跟踪方法。该方法利用最新量测信息估计目标运动模型概率及模型参数,并将估计得到的目标模型应用到粒子概率假设密度滤波方法的预测过程中生成预测粒子,从而将大部分粒子聚合在目标最可能出现的状态空间邻域中,实现粒子的有效利用。数值仿真表明,所提方法不仅显著地减少了目标丢失个数,而且提高了目标跟踪精度。     

Variational Bayesian labeled multi-Bernoulli filter with unknown sensor noise statistics

It is difficult to build accurate model for measurement noise covariance in complex back-grounds. For the scenarios of unknown sensor noise variances, an adaptive multi-target tracking algorithm based on labeled random finite set and variational Bayesian (VB) approximation is pro-posed. The variational approximation technique is introduced to the labeled multi-Bernoulli (LMB) filter to jointly estimate the states of targets and sensor noise variances. Simulation results show that the proposed method can give unbiased estimation of cardinality and has better performance than the VB probability hypothesis density (VB-PHD) filter and the VB cardinality balanced multi-target multi-Bernoulli (VB-CBMeMBer) filter in harsh situations. The simulations also confirm the robustness of the proposed method against the time-varying noise variances. The computational complexity of proposed method is higher than the VB-PHD and VB-CBMeMBer in extreme cases, while the mean execution times of the three methods are close when targets are well separated.     

Application of Road Information in Ground Moving Target Tracking

A new algorithm is developed to achieve accurate state estimation in ground moving target tracking by means of using road information. It is an adaptive variable structure interacting multiple model estimator with dynamic models modification （DMM VS-IMM for short）. Firstly, road information is employed to modify the target dynamic models used by filter, including modification of state transition matrix and process noise. Secondly, road information is applied to update the model set of a VS-IMM estimator. Predicted state estimation and road information are used to locate the target in the road network on which the model set is updated and finally IMM filtering is implemented. As compared with traditional methods, the accuracy of state estimation is improved for target moving not only on a single road, but also through an intersection. Monte Carlo simulation demonstrates the efficiency and robustness of the proposed algorithm with moderate computational loads.     

A measurement-driven adaptive probability hypothesis density filter for multitarget tracking

This paper studies the dynamic estimation problem for multitarget tracking. A novel gating strategy that is based on the measurement likelihood of the target state space is proposed to improve the overall effectiveness of the probability hypothesis density(PHD) filter. Firstly, a measurement-driven mechanism based on this gating technique is designed to classify the measurements. In this mechanism, only the measurements for the existing targets are considered in the update step of the existing targets while the measurements of newborn targets are used for exploring newborn targets. Secondly, the gating strategy enables the development of a heuristic state estimation algorithm when sequential Monte Carlo(SMC) implementation of the PHD filter is investigated, where the measurements are used to drive the particle clustering within the space gate.The resulting PHD filter can achieve a more robust and accurate estimation of the existing targets by reducing the interference from clutter. Moreover, the target birth intensity can be adaptive to detect newborn targets, which is in accordance with the birth measurements. Simulation results demonstrate the computational efficiency and tracking performance of the proposed algorithm.     

一种基于修正Hough变换的航迹起始算法

为了在重杂波区内检测出运动的目标,提出了一种修正的Hough变换算法用于初始航迹的建立。与传统的算法相比,修正算法充分利用目标的运动学信息,选取了更为合适的变换参量,仅利用较少拍数的量测就可以完成起始,能够在检测概率较高的环境下具有良好的起始性能。计算机仿真结果表明,算法能够克服传统算法的多拍扫描,大大缩短实际的计算量和起始时间,实现对航迹起始的在线改进。     

基于多级维纳滤波的双基地MIMO雷达多目标定位方法

为了降低双基地多输入多输出(MIMO)雷达目标定位过程中的计算复杂度,避免进行占主要计算量的协方差矩阵特征值分解或奇异值分解和二维空间谱的峰值搜索,将多级维纳滤波(MSWF)应用于双基地MIMO雷达多目标定位的研究中。利用MSWF的前向递推原理,得到信号子空间;然后利用ESPRIT算法估计发射角(DOD)和接收角(DOA),且DOD和DOA自动配对,实现了多目标交叉定位。分析了本文算法和ESPRIT算法的计算复杂度,并通过仿真实验及性能分析验证本文算法的有效性。理论分析和实验结果表明:本文算法在保证二维方位角估计性能的基础上,显著地降低了计算复杂度,缩短了运算时间,更加符合MIMO雷达信号实时处理的要求。     

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

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

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

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

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

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

相关色噪声下无冗余累积量稀疏表示DOA估计

针对传统均匀线阵中四阶累积量计算复杂度大、对快拍数敏感的问题,提出了一种快速去冗余的高分辨波达方向估计新方法。该方法首先通过构造选择矩阵对四阶累积量矩阵进行第1次降维处理,摒弃传统四阶累积量中大量冗余数据,然后对无冗余累积量矩阵进行矢量化并通过二次降维得到统计性能更优的向量观测模型,最后在相应的过完备基下建立观测模型的稀疏表示进行波达方向(Direction of Arrival,DOA)估计。同时将方法推广到L型阵列2维DOA估计,扩展了其应用范围。与传统的四阶累积量方法相比,该方法大大地减小了计算量,对快拍数要求不高,并且能够有效地抑制相关色噪声。理论分析和仿真实验验证了该方法对1维和2维DOA估计都具有较高的估计精度和分辨率。     

Multiple radar targets estimation by exploiting induced amplitude modulation

This work deals with the problem of estimating complex amplitudes, Doppler frequencies, and directions of arrival (DOA) of multiple targets present in the same range-azimuth resolution cell of a surveillance radar. The maximum likelihood (ML) and the asymptotic (large sample size) ML (AML) estimators are derived. To reduce the computational complexity of the maximization of the nonlinear two-dimensional criterion function of the AML estimator, we propose a computationally efficient algorithm based on the RELAXation method. It allows decoupling the problem of jointly estimating the parameters of the signal components into a sequence of simpler problems, where the parameters of each component are separately and iteratively estimated. The proposed method overcomes the resolution limitation of the classical monopulse technique and resolves multiple targets exhibiting an arbitrarily small difference in azimuth as long as their Doppler frequencies differ at least by the inverse of the number of integrated pulses, provided that enough signal-to-noise ratio (SNR) per pulse is available. The performance of the proposed AML-RELAX estimator is numerically investigated through Monte Carlo simulation and Cramer-Rao lower bound (CRLB) calculation.     

A memetic algorithm for path planning of curvature-constrained UAVs performing surveillance of multiple ground targets

The problem of generating optimal paths for curvature-constrained unmanned aerial vehicles （UAVs） performing surveillance of multiple ground targets is addressed in this paper. UAVs are modeled as Dubins vehicles so that the constraints of UAVs＇ minimal turning radius can be taken into account. In view of the effective surveillance range of the sensors equipped on UAVs, the problem is formulated as a Dubins traveling salesman problem with neighborhood （DTSPN）. Considering its prohibitively high computational complexity, the Dubins paths in the sense of terminal heading relaxation are introduced to simplify the calculation of the Dubins distance, and a boundary-based encoding scheme is proposed to determine the visiting point of every target neighborhood. Then, an evolutionary algorithm is used to derive the optimal Dubins tour. To further enhance the quality of the solutions, a local search strategy based on approximate gradient is employed to improve the visiting points of target neighborhoods. Finally, by a minor modification to the individual encoding, the algorithm is easily extended to deal with other two more sophisticated DTSPN variants （multi-UAV scenario and multiple groups of targets scenario）. The performance of the algorithm is demonstrated through comparative experiments with other two state-of-the-art DTSPN algorithms identified in literature. Numerical simulations exhibit that the algorithm proposed in this paper can find high-quality solutions to the DTSPN with lower computational cost and produce significantly improved performance over the other algorithms.     

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.