Abstract

To solve the problem of passive sensor data association in multi-sensor multi-target tracking, a novel linear-time direct data assignment (DDA) algorithm is proposed in this paper. Different from existing methods which solve the data association problem in the measurement domain, the proposed algorithm solves the problem directly in the target state domain. The number and state of candidate targets are preset in the region of interest, which can avoid the problem of combinational explosion. The time complexity of the proposed algorithm is linear with the number of sensors and targets while that of the existing algorithms are exponential. Computer simulations show that the proposed algorithm can achieve almost the same association accuracy as the existing algorithms, but the time consumption can be significantly reduced.

Highlights

  • The problem of passive sensor data association, that is, deciding which measurement derived from which target in a multi-sensor multi-target tracking problem has been investigated for many years in radar, reconnaissance and wireless communications [1,2,3,4,5], etc

  • A new direct data assignment (DDA) algorithm is proposed in this paper

  • To solve the problem of passive sensor data association, a linear-time DDA algorithm is proposed in this paper

Read more

Summary

Introduction

The problem of passive sensor data association, that is, deciding which measurement derived from which target in a multi-sensor multi-target tracking problem has been investigated for many years in radar, reconnaissance and wireless communications [1,2,3,4,5], etc. Lagrangian multipliers to relax the SDA problem as a series of 2-D assignment subproblems, which can be solved in O n3 (n is the number of measurements from each sensor) time using the modified auction algorithm [22,23]. These traditional SDA algorithms described above, solve the passive data association problem in the measurement domain. One obvious idea is to discard some false candidate targets when formulating the SDA problem, but it takes extra time to decide which candidate target is false Motivated by this fact, a new direct data assignment (DDA) algorithm is proposed in this paper.

Problem Formulation
Generalized SDA Problem
Linear-Time DDA Algorithm
Mechanism of DDA Algorithm
Termination Condition
Performance Analysis
Initialization of Candidate Targets
Computer Simulation
Simulation Results of Case 1
Simulation Results of Case 2
Simulation Results of Case 3
Simulation Results of Case 4
Simulation Results of Case 5
Simulation Results of Case 6
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call