Comparison of Nearest Neighbor and Probabilistic Data Association Filters for Target Tracking in Cluttered Environment

Author(s):  
Tensy Thomas ◽  
Sreeja S
Sensors ◽  
2016 ◽  
Vol 16 (12) ◽  
pp. 2180 ◽  
Author(s):  
Xiao Chen ◽  
Yaan Li ◽  
Yuxing Li ◽  
Jing Yu ◽  
Xiaohua Li

Sensors ◽  
2020 ◽  
Vol 20 (22) ◽  
pp. 6595
Author(s):  
Chengzhi Qu ◽  
Yan Zhang ◽  
Xin Zhang ◽  
Yang Yang

Data association is a crucial component of multiple target tracking, in which each measurement obtained by the sensor can be determined whether it belongs to the target. However, many methods reported in the literature may not be able to ensure the accuracy and low computational complexity during the association process, especially in the presence of dense clutters. In this paper, a novel data association method based on reinforcement learning (RL), i.e., the so-called RL-JPDA method, has been proposed for solving the aforementioned problem. In the presented method, the RL is leveraged to acquire available information of measurements. In addition, the motion characteristics of the targets are utilized to ensure the accuracy of the association results. Experiments are performed to compare the proposed method with the global nearest neighbor data association method, the joint probabilistic data association method, the fuzzy optimal membership data association method and the intuitionistic fuzzy joint probabilistic data association method. The results show that the proposed method yields a shorter execution time compared to other methods. Furthermore, it can obtain an effective and feasible estimation in the environment with dense clutters.


Sign in / Sign up

Export Citation Format

Share Document