The problem of two-dimensional bearings-only multisensor-multitarget tracking is addressed in this work. For this type of target tracking problem, the multidimensional assignment (MDA) is crucial for identifying measurements originating from the same targets. However, the computation of the assignment cost of all possible associations is extremely high. To reduce the computational complexity of MDA, a new coarse gating strategy is proposed. This is realized by comparing the Mahalanobis distance between the current estimate and initial estimate in an iterative process for the maximum likelihood estimation of the target position with a certain threshold to eliminate potential infeasible associations. When the Mahalanobis distance is less than the threshold, the iteration will exit in advance so as to avoid the expensive computational costs caused by invalid iteration. Furthermore, the proposed strategy is combined with the two-stage multiple hypothesis tracking framework for bearings-only multisensor-multitarget tracking. Numerical experimental results verify its effectiveness.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC8915076PMC
http://dx.doi.org/10.3390/s22051802DOI Listing

Publication Analysis

Top Keywords

bearings-only multisensor-multitarget
12
multisensor-multitarget tracking
12
coarse gating
8
gating strategy
8
multidimensional assignment
8
tracking problem
8
mahalanobis distance
8
tracking
5
strategy driven
4
driven multidimensional
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!