"Soft assignment algorithm" in maneuvering targets tracking

Guanghui Yu; Yaping Dai; Chaozhen Hou; Jie Chen

"Soft assignment algorithm" in maneuvering targets tracking

Guanghui Yu^*
, Yaping Dai
, Chaozhen Hou
, Jie Chen

^*Corresponding author for this work

School of Automation

Beijing Institute of Technology

Research output: Contribution to conference › Paper › peer-review

Abstract

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.

Original language	English
Pages	2687-2692
Number of pages	6
Publication status	Published - 2002
Event	Proceedings of the 4th World Congress on Intelligent Control and Automation - Shanghai, China Duration: 10 Jun 2002 → 14 Jun 2002

Conference

Conference	Proceedings of the 4th World Congress on Intelligent Control and Automation
Country/Territory	China
City	Shanghai
Period	10/06/02 → 14/06/02

Keywords

Associate
Maneuvering targets tracking
Soft assignment

Cite this

@conference{0ad9fc3e7efd4fb4bf8868a6c061bbc8,

title = "{"}Soft assignment algorithm{"} in maneuvering targets tracking",

abstract = "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.",

keywords = "Associate, Maneuvering targets tracking, Soft assignment",

author = "Guanghui Yu and Yaping Dai and Chaozhen Hou and Jie Chen",

year = "2002",

language = "English",

pages = "2687--2692",

note = "Proceedings of the 4th World Congress on Intelligent Control and Automation ; Conference date: 10-06-2002 Through 14-06-2002",

}

TY - CONF

T1 - "Soft assignment algorithm" in maneuvering targets tracking

AU - Yu, Guanghui

AU - Dai, Yaping

AU - Hou, Chaozhen

AU - Chen, Jie

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

KW - Associate

KW - Maneuvering targets tracking

KW - Soft assignment

UR - https://www.scopus.com/pages/publications/0036946007

M3 - Paper

AN - SCOPUS:0036946007

SP - 2687

EP - 2692

T2 - Proceedings of the 4th World Congress on Intelligent Control and Automation

Y2 - 10 June 2002 through 14 June 2002

ER -

"Soft assignment algorithm" in maneuvering targets tracking

Abstract

Conference

Keywords

Other files and links

Fingerprint

Cite this