A single-sensor, single-target mixture reduction (MR) data association algorithm is extended for use in multisensor, multitarget tracking situations. MR is extended for tracking an arbitrary number of targets using an arbitrary number of sensors under the assumption that the sensor measurement errors are independent across sensors. Like the single-sensor, single-target MR algorithm, which gives better performance than the probabilistic data association (PDA) filter, the multisensor, multitarget MR extensions give similar improvements in performance compared to the joint PDA (JPDA) and multisensor JPDA (MSJPDA) algorithms. Further, in the formulations for the multisensor and multitarget MR algorithms, the equations for the calculation of the data association probabilities have been put in the same form as for the JPDA, thus allowing previously developed fast JPDA computational techniques to be applicable. N the problem of tracking targets in random clutter, the optimal Bayesian solution leads to Gaussian mixture distributions that consist of an exponentially increasing number of components.1 In practice, the number of components in each mixture is kept in check by approximating it with fewer components. The nearest neighbor (NN) approximation reduces each target's mixture to its largest component.13 The joint probabilistic data association (JPDA) approximation merges the components of each target's mixture into a single Gaussian component.1'4 However, when there are several significant, well-spaced components in the original mixture, important information may be lost by using the NN or JPDA methods. A more flexible approximation method for single-sensor, single-target tracking, known as mixture reduction (MR), has been proposed by Salmond.5 This MR algorithm preserves the mean and covariance of the original mixture of components, successively merging components until the number of components is reduced to some userspecified limit. In this paper, we first review Salmond's MR algorithm for single-sensor tracking of a single target in clutter. We then derive extensions to Salmond's MR algorithm for use in tracking multiple targets and when there are measurements available from multiple sensors. Just as the single-sensor, single-target MR algorithm gives better performance5 than the probabilistic data association (PDA) filter, the multisensor, multitarget MR extensions are shown to give similar improvements in performance as compared to the JPDA and multisensor JPDA (MSJPDA)6 algorithms. Extension of the MR algorithm for tracking of multiple targets is necessary for use in realistic tracking scenarios where there are usually many targets that need to be tracked. Moreover, many current tracking systems have been designed with multiple sensors, thus requiring the further extension to a multisensor algorithm. The paper is organized as follows. In Sec. II, the target dynamics and measurement equations are defined. We review the singlesensor, single-target MR algorithm5 in Sec. Ill, and we extend the algorithm to the multitarget and multisensor cases in Sec. IV and V, respectively. In Sec. VI, simulation results evaluating the performances of the MR extensions are presented. Finally, concluding remarks are given in Sec. VII.