Data association approaches in bearings-only multi-target tracking

  • Xu B
  • Wang Z
  • 2


    Mendeley users who have this article in their library.
  • 0


    Citations of this article.


According to requirements of time computation complexity and correctness of data association of the multi-target tracking, two algorithms are suggested in this paper. The proposed Algorithm 1 is developed from the modified version of dual Simplex method, and it has the advantage of direct and explicit form of the optimal solution. The Algorithm 2 is based on the idea of Algorithm 1 and rotational sort method, it combines not only advantages of Algorithm 1, but also reduces the computational burden, whose complexity is only 1/N times that of Algorithm 1. Finally, numerical analyses are carried out to evaluate the performance of the two data association algorithms. © 2006 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • Bearings-only
  • Data association
  • Linear programming
  • Multi-target tracking

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Benlian Xu

  • Zhiquan Wang

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free