一种用于机动目标跟踪的新自适应卡尔曼滤波算法

在“当前”模型的概念下,从工程实现的背景出发,提出了一种用于机动目标跟踪的新自适应卡尔曼滤波算法。基本思想是通过对加速度项引入加权因子来进一步突出“当前”信息的作用,为“当前”模型提供更加准确的“当前”信息。蒙特卡罗模拟结果表明,算法不仅克服了“当前”模型自适应卡尔曼滤波算法的缺陷,而且使跟踪性能得到进一步的提高。     

机动多目标跟踪问题中关联区域的研究

 本文研究了跟踪多个机动目标时,由滤波算法所获得的新息向量范数的统计性质,关联区域的大小以及接收正确回波的概率。借助拉蒙特卡洛方法,考察了不同的目标状态模型、目标机动加速度及状态噪声方差等因素对所研究的问题的影响。研究表明,文献[1]所提出的机动目标状态模型及相应的自适应算法具有较好的适应目标机动的能力,关联区域的大小及接收正确回波的概率均较为稳定。     

引入神经网络的交互式多模型算法

在交互式多模型算法中引入神经网络算法以改进目标跟踪的精度。利用神经网络算法对基于机动目标“当前”统计模型的均值和方差自适应滤波算法进行修改,提高该算法的性能,然后采用交互作用多模型算法跟踪机动目标,提高了机动目标的跟踪精度。     

机动目标“当前”统计模型与自适应跟踪算法

本文提出机动目标“当前”统计模型的概念并建议用修正的瑞利-马尔科夫过程描述目标随机加速机动的统计特性。文中指出了在机动目标运动模型中状态（机动加速度）估值与状态噪声之间的内在联系。在此基础上提出了具有机动加速度均值及方差自适应的卡尔曼滤波算法。对一维和三维的情形进行了计算机模拟。计算结果表明,在仅对目标位置进行观测的情况下,这类自适应估值算法无论对高度机动或无机动的目标均可绘出较好的位置、速度及加速度估值。     

基于STF的Jerk模型自适应机动目标跟踪算法

在Jerk模型的基础上,提出了一种新的机动目标自适应跟踪算法STF-Jerk。该算法通过引入强跟踪滤波器(STF)的渐消因子,实时调节滤波器增益,增强了系统对突发机动的自适应跟踪能力,从而很好地改善了Jerk模型在跟踪机动目标时的跟踪精度。仿真结果表明,提出的STF-Jerk自适应跟踪算法显著提高了Jerk模型自适应算法的机动目标跟踪性能。     

常增益变采样率自适应滤波

作者曾给出一种跟踪飞机机动的自适应滤波,采用直角坐标系中的9维状态量,利用最优检测统计量探测目标机动,并用估计到的机动加速度修正目标的预报值。 本文将在文献[1]的基础上,提出两种简化自适应滤波。其一,采用两套直角坐标系中的9维卡尔曼滤波,其中的一套滤波用于取代最优检测统计量,完成对目标机动的探测和估计的功能;其二,采用三通道解偶的常增益变采样率自适应滤波。     

一种新的基于机动检测的机动目标跟踪算法

针对Kalman滤波跟踪机动目标发散和目前多数自适应Kalman滤波算法对运动模型适应性不强的问题,提出了一种新的基于机动检测的机动目标跟踪算法,通过实时自适应的改变滤波模型提高对机动目标跟踪精度。对这种方法与Kalman滤波算法进行了计算机仿真比较,结果表明,该方法计算量小,可实时精确地自适应匹配目标的运动模型,可实现对机动目标稳定可靠的跟踪。     

基于神经网络的机动目标信息融合与并行自适应跟踪

基于“当前”统计模型和 BP神经网络 ,提出一种新的机动目标神经网络信息融合与并行自适应跟踪算法 ( NIFPAT)。该算法采用双滤波器并行结构 ,利用全状态反馈 ,通过 BP网络调整系统方差以适应目标的运动变化 ,具有对目标各种运动状态的良好自适应跟踪能力     

高超声速滑翔目标自适应跟踪方法

针对机动模式复杂多变的高超声速滑翔目标跟踪问题，提出了一种机动频率自适应跟踪方法。采用介于常速度和常加速度模型之间的Singer模型来表征目标气动力加速度的变化，从而建立跟踪系统的状态方程。根据地基雷达量测量获得系统的量测方程，鉴于距离和角度信息的量级相差较大将其由球形量测量转换为位置量测量。为了适应高超声速滑翔目标灵活多样的机动模式，基于正交性原理和无迹卡尔曼滤波算法实现了Singer模型中机动频率参数的自适应。利用滤波信息计算得到能够反映状态模型误差大小的调整因子，用于放大Singer模型中的机动频率，进而调整状态方程的过程噪声以降低模型误差。通过对2种典型机动轨迹的跟踪仿真，并与交互式多模型等方法进行比较，结果表明所提方法的跟踪精度高、计算量小，能够较好地适应阶跃机动和连续幅值变化的机动。     

临近空间高超声速滑跃式轨迹目标跟踪技术

针对临近空间目标飞行速度快、机动特性强和加速度突变的特性,提出一种地心直角(ECEF)坐标系下基于目标特性分析的修正强跟踪滤波(MSTF)算法。首先,通过对ECEF坐标系下目标量测的无偏转化处理,以有效减小目标高超声速飞行所带来的旋转、平移和线性化误差影响;接着,在对目标特性充分分析的基础上,合理构建强跟踪滤波(STF)模型,通过对模型参数的自适应调节,以有效实现临近空间高超声速滑跃式轨迹目标的精确跟踪;最后,结合统计学原理对目标加速度的突变进行合理检测和补偿,以进一步修正强跟踪滤波模型的跟踪精度。仿真结果表明,与现有的临近空间目标跟踪算法相比,该算法具有较高的定位跟踪精度。     

机动目标的多项式预测模型及其跟踪算法

根据匀变速运动的多项式描述形式,利用多项式预测滤波器对目标状态建模,提出了一种全新机动目标运动的动态模型——多项式预测模型,并针对这个全新的模型给出了相应的最优滤波算法。分析表明：该模型可以精确描述任意可以由多项式描述的目标运动,而不需要已知运动的具体参数,因此相应的最优滤波算法适用于任何可以用多项式描述的机动目标状态估计问题。一个机动目标跟踪问题的计算机仿真证明了本文方法的有效性和实用性。     

Interacting acceleration compensation algorithm for trackingmaneuvering targets

The two-stage Kalman estimator has been studied for state estimation in the presence of random bias and applied to the tracking of maneuvering targets by treating the target acceleration as a bias vector. Since the target acceleration is considered a bias, the first stage contains a constant velocity motion model and estimates the target position and velocity, while the second stage estimates the target acceleration when a maneuver is detected, the acceleration estimate is used to correct the estimates of the first stage. The interacting acceleration compensation (IAC) algorithm is proposed to overcome the requirement of explicit maneuver detection of the two-stage estimator. The IAC algorithm is viewed as a two-stage estimator having two acceleration models: the zero acceleration of the constant velocity model and a constant acceleration model. The interacting multiple model (IMM) algorithm is used to compute the acceleration estimates that compensate the estimate of the constant velocity filter. Simulation results indicate the tracking performance of the IAC algorithm approaches that of a comparative IMM algorithm while requiring approximately 50% of the computations     

An adaptive attitude algorithm based on a current statistical model for maneuvering acceleration

A current statistical model for maneuvering acceleration using an adaptive extended Kalman filter(CS-MAEKF) algorithm is proposed to solve problems existing in conventional extended Kalman filters such as large estimation error and divergent tendencies in the presence of continuous maneuvering acceleration. A membership function is introduced in this algorithm to adaptively modify the upper and lower limits of loitering vehicles' maneuvering acceleration and for realtime adjustment of maneuvering acceleration variance. This allows the algorithm to have superior static and dynamic performance for loitering vehicles undergoing different maneuvers. Digital simulations and dynamic flight testing show that the yaw angle accuracy of the algorithm is 30% better than conventional algorithms, and pitch and roll angle calculation precision is improved by 60%.The mean square deviation of heading and attitude angle error during dynamic flight is less than3.05°. Experimental results show that CS-MAEKF meets the application requirements of miniature loitering vehicles.     

三维空间中目标机动加速度的估值问题

建立了描述目标在三维空间中进行切向与法向机动的非线性状态模型。目标切向与法向机动加速度的幅值表示为修正的瑞利-马尔可夫随机过程;法向加速度的方向角则假定在2π区间内具有均匀的概率密度。在仅有含噪声位置观察数据的情况下,发展了一种推广的卡尔曼滤波和自适应算法,并由此获得一种机动目标切向与法向加速度估值的直接方法。提供了某些计算结果以证实方法的有效性。     

Improved tracking of maneuvering targets: The use of turn-ratedistributions for acceleration modeling

Tactically maneuvering targets are difficult to track since acceleration cannot be observed directly and the accelerations are induced by human control or an autonomous guidance system therefore they are not subject to deterministic models. A common tracking system is the two-state Kalman filter with a Singer maneuver model where the second-order statistics of acceleration is the same as a first-order Markov process. The Singer model assumes a uniform probability distribution on the targets acceleration which is independent of the x and y direction. In practice, it is expected that targets have constant forward speed and an acceleration vector normal to the velocity vector, a condition not present in the Singer model. The work of Singer is extended by presenting a maneuver model which assumes constant forward speed and a probability distribution on the targets turn-rate. Details of the model are presented along with sample simulation results     

A Decision?Directed Adaptive Tracker

In the design of a tracking filter for air traffic control (ATC) applications, a maneuvering aircraft can be modelled by a linear system with random noise accelerations. A Kalman filter tracker, designed on the basis of a variance chosen according to the distribution of the potential maneuver accelerations, will maintain track during maneuvers and provide some improvement in position accuracy. However, during those portions of the flight path where the aircraft is not maneuvering, the tracking accuracy will not be as good as if no acceleration noise had been allowed in the tracking filter. In this paper, statistical decision theory is used to derive an optimal test for detecting the aircraft maneuver; a more practical suboptimal test is then deduced from the optimal test. As long as no maneuver is declared, a simpler filter, based on a constant-velocity model, is used to track the aircraft. When a maneuver is detected, the tracker is reinitialized using stored data, up-dated to the present time, and then normal tracking is resumed as new data arrives. In essence, the tracker performs on the basis of a piecewise linear model in which the breakpoints are defined on-line using the maneuver detector. Simulation results show that there is a significant improvement in tracking capability using the decision-directed adaptive tracker.     

A tracking algorithm for maneuvering targets

A methodology for the tracking of maneuvering targets is presented. A quickest-detection scheme based on the innovation sequence is developed for a prompt detection of target maneuvers. The optimal length of a sliding window that minimizes the maneuver detection delay for a given false-alarm rate is determined. After maneuver detection, the system model is modified by adding a maneuver term. A recursive algorithm is proposed to estimate the maneuver magnitude. With this estimate, a modified Kalman filter is used for tracking. Simulation results demonstrate the superior performance of the algorithm, especially during target maneuvers