Data association approaches in bearings-only multi-target tracking

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Xu, B., & Wang, Z. (2008). Data association approaches in bearings-only multi-target tracking. Communications in Nonlinear Science and Numerical Simulation, 13(2), 489–499. https://doi.org/10.1016/j.cnsns.2006.03.006

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free