用于弹道目标跟踪的有限差分扩展卡尔曼滤波算法  

Finite-Difference Extended Kalman Filtering Algorithm for Ballistic Target Tracking

作　　者：巫春玲[1] 韩崇昭[1] 

机构地区：[1]西安交通大学电子与信息工程学院,西安710049

出　　处：《西安交通大学学报》2008年第2期143-146,242,共5页Journal of Xi'an Jiaotong University

基　　金：国家重点基础研究发展计划资助项目(2001309405);国家自然科学基金资助项目(60574033)

摘　　要：针对目前常用的滤波算法不能同时做到精确和高效跟踪目标的缺点,提出一种有限差分扩展卡尔曼滤波(FDEKF)算法用于再入阶段的弹道目标跟踪.该算法应用有限差分运算得到滤波的验前、验后误差协方差矩阵,避免了非线性函数求导运算,以及Jacobian阵和Hessian阵的计算,降低了计算难度,扩大了应用范围,增强了滤波过程的收敛性.Monte Carlo数值仿真表明,FDEKF算法与扩展卡尔曼滤波(EKF)算法和无味卡尔曼滤波(UKF)算法相比较,在跟踪精度上比EKF算法提高了约20%,与UKF算法相当,在计算复杂度上比EKF算法稍有增加,但比UKF算法低约39%.这说明FDEKF算法在计算量增加不多的情况下,滤波精度有显著提高.In order to overcome the disadvantage of the common used filtering algorithms that can not achieve the tracking accuracy and effectiveness at the same time, a finite-difference extending Kalman filter algorithm was proposed for ballistic target tracking problem in the re-entry phase. This algorithm uses finite differences to approximate the priori error covariance matrix and the posterior error covariance matrix, and avoids evaluations of derivatives, the Jacobian and Hessian matrices, which enlarge the application areas and improve the filtering convergence. The Monte Carlo simulations show that, compared with the extended Kalman filter （EKF） and the unsented Kalman filter （UKF）, the tracking accuracy of the new algorithm is close to that of UKF, but 20% higher than that of EKF; the computational complexity of the new algorithm is close to that of EKF, but 39% lower than that of UKF. All these results show that the filtering accuracy of the proposed algorithm is improved evidently with a little increasing in computational cost.

关 键 词：弹道目标跟踪 扩展卡尔曼滤波 无味卡尔曼滤波 有限差分 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]