M-最优假设组合航迹关联算法

J4 ›› 2012, Vol. 34 ›› Issue (2): 176-180.

M-最优假设组合航迹关联算法

杨任农，陈岩，邬蒙，黄震宇，张喆，白娟

（空军工程大学工程学院，陕西西安 710038）

收稿日期:2010-11-23 修回日期:2011-04-08 出版日期:2012-02-25 发布日期:2012-02-25

A Tentative Study on the Approaches to Track Initiation

YANG Rennong,CHEN Yan，WU Meng,HUANG Zhenyu,ZHANG Zhe,BAI Juan

(School of Engineering,Air Force Engineering University,Xi’an 710038,China)

Received:2010-11-23 Revised:2011-04-08 Online:2012-02-25 Published:2012-02-25

摘要/Abstract

摘要：

本文在深入研究基于M最优假设航迹关联方法和假设管理技术的基础上，提出了构建组合关联体的假设管理技术。利用该技术，提出了基于M最优假设组合航迹关联算法。该方法在有效低可行假设数目的情况下，能够得到较为精确的关联航迹并且缩短了算法运行时间，适合用于密集杂波环境下的多目标航迹关联。仿真结果表明了算法的有效性。

关键词: M-最优假设；假设管理技术；K-相似准则；航迹关联算法

Abstract:

After a thorough study on the Mbest hypothesis method for track association and hypothesis management, this paper proposes a novel hypothesis management technique based on establishing the combinable association sets, and a novel track association algorithm is brought forth by utilizing the technique. This approach can reduce the number of hypothesis efficaciously and provide accurate track association and shorten the run time. It is appropriate to multitarget track association under dense clutters. The simulation results testify the validity of the present approach.

Key words: M-best hypothesis；hypothesis management；K-similar rule；track association algorithm

杨任农，陈岩，邬蒙，黄震宇，张喆，白娟. M-最优假设组合航迹关联算法[J]. J4, 2012, 34(2): 176-180.

YANG Rennong,CHEN Yan，WU Meng,HUANG Zhenyu,ZHANG Zhe,BAI Juan. A Tentative Study on the Approaches to Track Initiation[J]. J4, 2012, 34(2): 176-180.