We present a fast data association technique based on clustering and multidimensional assignment algorithms for multisensor-multitarget tracking Assignment-based methods have been shown to be very effective for data association. Multidimensional assignment for data association is an NP-hard problem and various near-optimal modifications with (pseudo-)polynomial complexity have been proposed. In multidimensional assignment, candidate assignment tree building consumes about 95% of the time. We present the development of a fast data association algorithm, which partitions the problem into smaller sub-problems. A clustering approach, which attempts to group measurements before forming the candidate tree, is developed for various target-sensor configurations. Simulation results show significant computational savings over the standard multidimensional assignment approach without clustering.
Fast data association using multidimensional assignment with clustering
IEEE Transactions on Aerospace and Electronic Systems ; 37 , 3 ; 898-913
2001-07-01
1076873 byte
Article (Journal)
Electronic Resource
English
PAPERS - Fast Data Association Using Multidimensional Assignment With Clustering
Online Contents | 2001
|PAPERS - Efficient Multisensor Fusion Using Multidimensional Data Association
Online Contents | 2001
|