首页> 外文会议>International Conference on Information Fusion >A novel multiple-model treatment for maneuvering target tracking
【24h】

A novel multiple-model treatment for maneuvering target tracking

机译:一种新颖的机动目标跟踪多模型处理方法

获取原文

摘要

This paper addresses the maneuvering target tracking (MTT) problems for linear discrete-time dynamic systems with multiple models. A generalized formulation of the multiple-model (MM) dynamic systems is proposed, and a new treatment called random parameters Kalman filtering (RPKF) is investigated. The random parameters including some coefficient matrices and noise covariances are used to characterize the motion mode uncertainty of the MTT problem at each time instant. The proposed approach is different from the classical MM approach which has been received great attentions for solving the MTT problem. Compared with the interacting multiple model (IMM) algorithm that uses model probabilities to weight the inputs and outputs of a bank of parallel Kalman filters, the RPKF algorithm uses model probabilities to weight the possible coefficient matrices and noise covariances resulting in performing a single filter. The recursive state estimation formulae for a class of specific MM dynamic system are provided for three scenarios which are optimal in the mean squared error sense under some conditions. Some numerical simulations demonstrate the performance, including the good estimation accuracy and low computational complexity, of the proposed RPKF algorithm by comparing with the IMM algorithm.
机译:本文解决了具有多个模型的线性离散时间动态系统的机动目标跟踪(MTT)问题。提出了多模型(MM)动态系统的广义公式,并研究了一种称为随机参数卡尔曼滤波(RPKF)的新处理方法。包括一些系数矩阵和噪声协方差在内的随机参数用于表征每个时刻MTT问题的运动模式不确定性。所提出的方法与经典的MM方法不同,经典的MM方法在解决MTT问题上受到了极大的关注。与使用模型概率加权一组并行Kalman滤波器的输入和输出的交互多模型(IMM)算法相比,RPKF算法使用模型概率加权可能的系数矩阵和噪声协方差,从而执行单个滤波器。针对在特定条件下均方误差意义上最优的三种情况,提供了一类特定的MM动态系统的递归状态估计公式。通过与IMM算法的比较,一些数值模拟证明了所提出的RPKF算法的性能,包括良好的估计精度和较低的计算复杂度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号