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)