导航
ACTA AERONAUTICAET ASTRONAUTICA SINICA ›› 1994, Vol. 15 ›› Issue (5): 558-563.
• 论文 • Previous Articles Next Articles
Pan Quan, Zhang Hongcai, Xiang Yangzhao, Wang Peide
Received:
Revised:
Online:
Published:
Abstract: The JPDA algorithm has excellent performance on tracking multiple targets in dense clutter environment. But its complexity will increase rapidly with the nurnber of targets and re-turns,which makes it almost impossible to be realized on realtime,In this paper,a graph search-ing algorithm which can search out N events with the largest joint probabilities is presented and an approximate bayesian estimation formula with these N events is then developed.In addition,an approach to the calculation of valuation function and repetition is also put forward.In this way,we form a new quick algorithm.The algorithm is of the performance equivalent to JPDA and its comoutation can be reduced drastically.
Key words: combinatorial analysis, target aquisition, graph (charts)
CLC Number:
V249.122.9
T:V953.1
Pan Quan;Zhang Hongcai;Xiang Yangzhao;Wang Peide. COMBINATORIAL QUICK JPDA ALGORITHM[J]. ACTA AERONAUTICAET ASTRONAUTICA SINICA, 1994, 15(5): 558-563.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://hkxb.buaa.edu.cn/EN/
https://hkxb.buaa.edu.cn/EN/Y1994/V15/I5/558