A RECURSIVE AND PARALLEL FAST JPDA ALGORITHM

Joint Probabilistic Data Association (JPDA) is a very fine optimal multitarget tracking and association algorithm in clutter. However, the calculation explosion effect in computation of association probabilities has been a difficulty. This paper will discuss a method based on layered searching construction of association hypothesis events. According to the method, the searching schedule of the association events between two layers can be recursive and with independence, so it can also be implemented in parallel structure. Comparative analysis of the method with relative methods in other references and corresponding computer simulation tests and results are also given in the paper.