A method for tracking a manoeuvring multitarget in a cluttered environment is presented. The clutter or false alarms are assumed to occur uniformly and to be independently distributed. The algorithm is performed by taking a sliding window of length uT (T is the sampling time) at time K. Instead of solving a large problem, the entire set of targets and measurements is divided into clusters so that a number of smaller problems are solved independently. When a set of measurements is received, we form a new data-association hypothesis for the set of measurements lying in the validation gales; with each cluster from time K — u + 1 to K the probability of each track history is computed, and ihen by choosing the largest of these histories we perform the target measurement updated with the adaptive state esiimator. Meanwhile, the covariance-matching technique is adopted so that the accuracy of the adaptive state estimator will be improved. Simulation has shown the effectiveness of the tracking algorithm.