Title :
A pruning technique of feasible matrixes of JPDA algorithm
Author :
Minghui, Wang ; Zhisheng, You ; Rongchun, Zhao ; Jianzhou, Zhang
Author_Institution :
Dept. of Comput. Sci., Northwestern Polytech. Univ., Xian, China
Abstract :
The cause of the computation complexity of the joint probability data association (JPDA) algorithm is that the validation matrix is decomposed to lots of feasibility matrices, and so the number of feasibility matrices increases exponentially with the complexity of the validation matrix. So we think that the speed of the JPDA can be improved by decreasing the complexity of validation matrix with improving the performance of the tracking gate. This is demonstrated, with some simulations
Keywords :
computational complexity; matrix algebra; probability; JPDA algorithm; computation complexity; feasibility matrices; joint probability data association; pruning technique; tracking gate; validation matrix decomposition; Computer science; Matrix decomposition;
Conference_Titel :
Intelligent Control and Automation, 2000. Proceedings of the 3rd World Congress on
Conference_Location :
Hefei
Print_ISBN :
0-7803-5995-X
DOI :
10.1109/WCICA.2000.859968
