Generalized input-estimation technique for tracking maneuveringtargets

A new input estimation technique for target tracking problem is proposed. Conventional input estimation techniques assume that the target maneuver level is constant within the detection window, which has been the major drawback of the techniques. The proposed technique is developed to overcome this drawback by modeling the target maneuver as a linear combination of some basic time functions. The resulting algorithm has a generalized formulation including earlier works on input estimation. A detection performance of the proposed algorithm is analyzed by investigating the detection sensitivity according to the selection of maneuver models and other design parameters such as the detection window size, measurement noise level, and sampling step size. A computer simulation study shows that the estimation performance of the proposed algorithm is comparable to Bogler's input estimation method while the computation time is greatly reduced     

涡扇发动机变参数鲁棒H_∞滤波器设计

针对存在建模误差及测量噪声干扰条件下的涡扇发动机性能参数估计问题,标准卡尔曼滤波及其改进算法滤波估计误差收敛速度慢,滤波估计精度低,对不确定测量噪声及建模误差较为敏感,为此本文提出了一种变参数鲁棒H_∞滤波器设计方法。该方法采用仿射参数依赖Lyapunov函数设计满足H_∞性能指标要求的鲁棒滤波器,通过引入凸多胞技术,将参数依赖线性矩阵不等式(Linear Matrix Inequality,LMI)中变参数Lyapunov矩阵与系统系数矩阵之间耦合乘积导致的非凸优化问题,转化为常规LMI约束下的凸优化问题进行求解,降低了线性变参数(Linear Parameter Varying,LPV)鲁棒滤波器设计的保守性,得到了全局解。针对涡扇发动机的仿真结果表明:与扩展卡尔曼滤波器对比,采用该方法设计的滤波器具有较快的动态跟踪速度和较高的滤波精度,ΔFn的稳态估计误差不大于0.1%,ΔFn的相对估计误差不大于2.5%,同时对建模误差和测量噪声干扰具有较强的抑制能力。     

Detection of Target Maneuver Onset

A classical maneuvering target tracking (MTT) problem (detection of the onset of a target maneuver) is presented in two parts. The first part reviews most traditional maneuver onset detectors and presents results from a comprehensive simulation study and comparison of their performance. Six algorithms for maneuver onset detection are examined: measurement residual chi-square, input estimate chi-square, input estimate significance test, generalized likelihood ratio (GLR), cumulative sum, and marginalized likelihood ratio (MLR) detectors. The second part proposes two novel maneuver onset detectors based on sequential statistical tests. Cumulative sums (CUSUM) type and Shiryayev sequential probability ratio (SSPRT) maneuver onset detectors are developed by using a likelihood marginalization technique to cope with the difficulty that the target maneuver accelerations are unknown. The proposed technique gives explicit solutions for Gaussian-mixture prior distributions, and can be applied to arbitrary prior distributions through Gaussian-mixture approximations. The approach essentially utilizes a~priori information about the maneuver accelerations in typical tracking engagements and thus allows to improve detection performance as compared with traditional maneuver detectors. Simulation results demonstrating the improved capabilities of the proposed onset maneuver detectors are presented.     

Robust extended Kalman filter with input estimation for maneuver tracking

This study investigates the problem of tracking a satellite performing unknown continuous maneuvers. A new method is proposed for estimating both the state and maneuver acceleration of the satellite. The estimation of the maneuver acceleration is obtained by the combination of an unbiased minimum-variance input and state estimation method and a low-pass filter. Then a threshold-based maneuver detection approach is developed to determinate the start and end time of the unknown maneuvers. During the maneuvering period, the estimation error of the maneuver acceleration is modeled as the sum of a fluctuation error and a sudden change error. A robust extended Kalman filter is developed for dealing with the acceleration estimate error and providing state estimation. Simulation results show that, compared with the Unbiased Minimum-variance Input and State Estimation (UMISE) method, the proposed method has the same position estimation accuracy, and the velocity estimation error is reduced by about 5 times during the maneuver period. Besides, the acceleration detection and estimation accuracy of the proposed method is much higher than that of the UMISE method.     

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     

Minimal submodel-set algorithm for maneuvering target tracking

The variable structure multiple model (VSMM) approach to the maneuvering target tracking problem is considered. A new VSMM design, the minimal submodel-set switching (MSMSS) algorithm for tracking a maneuvering target is presented. The MSMSS algorithm adaptively determines the minimal set of models from the total model set and uses this to perform multiple models (MM) estimation. In addition, an iterative MSMSS algorithm with improved maneuver detection and termination properties is developed. Simulations results demonstrate that, compared with a standard interacting MM (IMM), the proposed algorithms require significantly lower computation while maintaining similar tracking performance. Alternatively, for a computational load similar to IMM, the new algorithms display significantly improved performance.     

Robust optimization of aircraft weapon delivery trajectory using probability collectives and meta-modeling

 Conventional trajectory optimization techniques have been challenged by their inability to handle threats with irregular shapes and the tendency to be sensitive to control variations of aircraft. Aiming to overcome these difficulties, this paper presents an alternative approach for trajectory optimization, where the problem is formulated into a parametric optimization of the maneuver variables under a tactics template framework. To reduce the size of the problem, global sensitivity analysis (GSA) is performed to identify the less-influential maneuver variables. The probability collectives (PC) algorithm, which is well-suited to discrete and discontinuous optimization, is applied to solve the trajectory optimization problem. The robustness of the trajectory is assessed through multiple sampling around the chosen values of the maneuver variables. Meta-models based on radius basis function (RBF) are created for evaluations of the means and deviations of the problem objectives and constraints. To guarantee the approximation accuracy, the meta-models are adaptively updated during optimization. The proposed approach is demonstrated on a typical airground attack mission scenario. Results reveal that the proposed approach is capable of generating robust and optimal trajectories with both accuracy and efficiency.     

Tracking a maneuvering target using input estimation versus theinteracting multiple model algorithm

Two maneuvering-target tracking techniques are compared. The first, called input estimation, models the maneuver as constant unknown input, estimates its magnitude and onset time, and then corrects the state estimate accordingly. The second models the maneuver as a switching of the target state model, where the various state models can be of different dimension and driven by process noises of different intensities, and estimates the state according to the interacting multiple model (IMM) algorithm. While the first requires around twenty parallel filters, it is shown that the latter, implemented in the form of the IMM, performs equally well or better with two or three filters     

Incremental maneuver estimation model for target tracking

An incremental model for maneuver detection and estimation for use in target tracking with the Kalman filter is described. The approach is similar to the multiple Kalman filter bank, but with a memory for the maneuver status for the track under consideration. The advantage of this approach is that the target acceleration can be more accurately estimated. The maneuver-detection model has shown good maneuver-following capability. Moreover, it needs only a finite number of Kalman filters to handle all possible maneuver values and it responds quickly as maneuver occurs. When there is an abrupt maneuver change the model can still track the targets in short time     

Application of Recursive Estimation and Kalman Filtering to Doppler Tracking

The techniques of recursive estimation and Kalman filtering are applied to the problem of estimation of space vehicle orbits and trajectories using only measurements of the Doppler shifts in radio signals transmitted by or reflected from the target. Two approaches are described. One is a global fit technique in which the parameters of an assumed trajectory model are estimated. The second is a pointwise mapping technique in which the trajectory estimate is extrapolated as the target tracking data is received. The paper provides a tutorial illustration of the direct application of recursive optimization techniques to a class of engineering problems.     

Tracking a Maneuvering Target Using Input Estimation

The conventional Kalman tracking filter incurs mean tracking errors in the presence of a pilot-induced target maneuver. Chan,Hu, and Plant proposed a solution to this problem which used themean deviations of the residual innovation sequence to make corrections to the Kalman filter. This algorithm is further developedhere for the case of a one-dimensional Kalman filter, for which an Implementable closed-form recursive relation exists. Simulation results show that the Chan, Hu, and Plant method can accurately detect and correct an acceleration discontinuity under a variety of maneuver models and radar parameters. Also, the inclusion of thislogic into a multiple hypothesis tracking system is briefly outlined.     

单天基平台测向的空间非合作目标跟踪

针对仅含角度测量信息的单个天基平台可观测性较弱的问题,提出了一种含脉冲机动检测的空间非合作目标跟踪算法,并设计了非合作目标实时跟踪数据处理流程.该算法利用抗差估计技术和UKF（Unscented Kalman Filter,无迹卡尔曼滤波）算法构造目标跟踪滤波器,并综合残差多项式拟合和新息分布特征等方法实现目标机动检测,在天基平台观测信息类型有限和观测几何较差的情况下,可以同时排除孤立野值和成片测量野值的影响,实现非合作机动目标的连续稳定跟踪.数值实验验证了算法的可行性和有效性,也表明了跟踪精度和可靠性与测量精度密切相关.     

遗传模拟退火算法在机动逃逸策略中的应用

针对垂直平面内的机动逃逸策略问题,提出将遗传算法与模拟退火算法相结合的方法———遗传模拟退火算法,能够实现逃逸者的机动逃逸策略,解决了在大状态空间中的全局最优搜索和评价问题,为处理复杂的决策过程提供了一套有效的途径。通过仿真结果表明,基于遗传模拟退火算法的机动策略能够有效地实现逃逸者的机动逃逸。     

先进战斗机过失速机动模型飞行试验技术

具有过失速机动能力的战斗机在近距空战中能够取得快速占位、先敌瞄准、有效规避攻击的战术优势,是先进战斗机的标志性性能要求。模型飞行试验技术作为空气动力学研究三大手段之一,在解决飞行器技术难题、实现技术创新方面发挥了重要作用。本文介绍了中国空气动力研究与发展中心利用带动力自主控制模型飞行试验平台发展的过失速机动模型飞行试验技术,以及开展的先进战斗机构型典型过失速机动模型飞行试验,分述了在大迎角非定常气动建模、宽量程气流系参数测量、大迎角非线性控制、推力矢量控制、大迎角非定常气动参数辨识方面的研究工作与解决这些关键问题的技术途径。通过此项研究,在国内首次实现了先进战斗机构型缩比模型典型过失速机动飞行,相关研究成果可为先进战斗机实现过失速机动飞行能力提供有力的技术支撑。     

Streamlining measurement iteration for EKF target tracking

The estimation problem is defined, and a review of how the linear estimation approach of Kalman filtering is extrapolated to form an extended Kalman filter (EKF), applicable for state estimation in nonlinear systems is presented. A mechanization of an EKF variation known as an iterated EKF, offering improved tracking performance, is treated. A streamlined version of an iterated EKF that has a lesser computational burden (fewer operations per cycle or time step) than prior formulations is offered. A nonlinear filtering application example, to be used as a testbed for this new approach, is described, and the detailed modeling considerations as needed for exoatmospheric random-variable radar target tracking are discussed. The performance of the streamlined mechanization is illustrated in this radar target tracking example, and comparisons are made with the performance of an EKF without measurement iteration     

Multisignal time delay detection and tracking

An optimum solution to the time delay detection and tracking problem for a single signal is extended to the multisignal problem where the number of signals present in the observed data (if any) is unknown. The number of signals present is determined, and the time delay of each detected signal is tracked. The number of possible global, or first level, hypotheses is large because of the exponential dependence on the number of potential signals. An efficient approximate multisignal detection and tracking solution that is as near optimum as possible for the computational resources required is developed. It has the form of parallel detector-trackers (one for each potential signal) each similar to the single-signal case, with communication between them. Test results demonstrate the utility of the approach     

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.     

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.     

Discrete-time min-max tracking

The problem of optimal state estimation of linear discrete-time systems with measured outputs that are corrupted by additive white noise is addressed. Such estimation is often encountered in problems of target tracking where the target dynamics is driven by finite energy signals, whereas the measurement noise is approximated by white noise. The relevant cost function for such tracking problems is the expected value of the standard H/sub /spl infin// performance index, with respect to the measurement noise statistics. The estimator, serving as a tracking filter, tries to minimize the mean-square estimation error, and the exogenous disturbance, which may represent the target maneuvers, tries to maximize this error while being penalized for its energy. The solution, which is obtained by completing the cost function to squares, is shown to satisfy also the matrix version of the maximum principle. The solution is derived in terms of two coupled Riccati difference equations from which the filter gains are derived. In the case where an infinite penalty is imposed on the energy of the exogenous disturbance, the celebrated discrete-time Kalman filter is recovered. A local iterations scheme which is based on linear matrix inequalities is proposed to solve these equations. An illustrative example is given where the velocity of a maneuvering target has to be estimated utilizing noisy measurements of the target position.     

A maximum likelihood approach to data association

An approach is presented to data association (DA) problems for which measurements are independent from scan to scan. It is demonstrated that maximum likelihood (ML) estimation of target parameters may be efficiently implemented by an EM iterative scheme. The algorithm is applied to multitarget trajectory estimation of constant-velocity targets from passive (bearing-only) sensors