摘要
The optimal solution of "assignment problem" in maneuvering targets tracking (MTT) is how to associate measurements with tracks correctly. It is critical in MTT. The earlier "traditional assignment algorithms" has poor performance because it does not consider of missing and new targets. "modern augment assignment algorithm" overcomes the two shortcomings above, But in the same time, the risk of error association probability becomes higher. This paper presents a new assignment algorithm-"soft assignment". It need not consider of missing and new targets while it is an optimal solution based on the following two criterions: (1) the correct association probability is high; (2) the number of association is near to the actual ones. The two criterions are presented in form of function and the optimal solution using "soft assignment" can also be obtained.
| 源语言 | 英语 |
|---|---|
| 页 | 2687-2692 |
| 页数 | 6 |
| 出版状态 | 已出版 - 2002 |
| 活动 | Proceedings of the 4th World Congress on Intelligent Control and Automation - Shanghai, 中国 期限: 10 6月 2002 → 14 6月 2002 |
会议
| 会议 | Proceedings of the 4th World Congress on Intelligent Control and Automation |
|---|---|
| 国家/地区 | 中国 |
| 市 | Shanghai |
| 时期 | 10/06/02 → 14/06/02 |