Fast algorithm for data association in multisensor multitarget distributed tracking

A fast algorithm for MSMT data association, Which includes initial association and fine association, is presented based on the fusion of local estimations. The data association algorithm based on ternary searching is extended to MSMT case. On the basis of it, the relation between local position estimations at the main sensor and ones at others is given. The fine association is completed by using nearest neighbor JPDA (NNJPDA). All local estimations from the same targets are fused to obtain the global estimations. A comparison of the algorithm here the existing distributed JPDA one is made, which shows that this algorithm can reduce the computational cost with basic approximate performance.