Data association is the key problem in multitarget tracking in the cluttenenvi-ronments. Now the joint probabistic data association (JPDA) algorithms is known as a more effective method，but the cost of computation and memory for this algorithms is always so great that this method coit be wsed in the practical multiple target tracking (MTT) system. Therefore，it is necessary to search for a fast or approximations algorithms for the JPDA. Here we provide a group of algorithms that we have preliminarily proved effective in our relevant subject.