We demonstrate a heuristic approach for optimizing the posterior density of the data association tracking algorithm via the random finite set(RFS)theory.Specifically,we propose an adjusted version of the joint probabi...We demonstrate a heuristic approach for optimizing the posterior density of the data association tracking algorithm via the random finite set(RFS)theory.Specifically,we propose an adjusted version of the joint probabilistic data association(JPDA)filter,known as the nearest-neighbor set JPDA(NNSJPDA).The target labels in all possible data association events are switched using a novel nearest-neighbor method based on the Kullback-Leibler divergence,with the goal of improving the accuracy of the marginalization.Next,the distribution of the target-label vector is considered.The transition matrix of the target-label vector can be obtained after the switching of the posterior density.This transition matrix varies with time,causing the propagation of the distribution of the target-label vector to follow a non-homogeneous Markov chain.We show that the chain is inherently doubly stochastic and deduce corresponding theorems.Through examples and simulations,the effectiveness of NNSJPDA is verified.The results can be easily generalized to other data association approaches under the same RFS framework.展开更多
基金Project supported by the National Key Research and Development Program of China(No.2017YFB1402102)the National Natural Science Foundation of China(Nos.61907028 and 11872036)+2 种基金the Natural Science Foundation of Shaanxi Province,China(Nos.2020JQ-423,2019JQ-574,and 2019ZDLSF07-01)the Fundamental Research Funds for the Central Universities,China(No.GK201903103)the China Postdoctoral Science Foundation(No.2018M640950)。
文摘We demonstrate a heuristic approach for optimizing the posterior density of the data association tracking algorithm via the random finite set(RFS)theory.Specifically,we propose an adjusted version of the joint probabilistic data association(JPDA)filter,known as the nearest-neighbor set JPDA(NNSJPDA).The target labels in all possible data association events are switched using a novel nearest-neighbor method based on the Kullback-Leibler divergence,with the goal of improving the accuracy of the marginalization.Next,the distribution of the target-label vector is considered.The transition matrix of the target-label vector can be obtained after the switching of the posterior density.This transition matrix varies with time,causing the propagation of the distribution of the target-label vector to follow a non-homogeneous Markov chain.We show that the chain is inherently doubly stochastic and deduce corresponding theorems.Through examples and simulations,the effectiveness of NNSJPDA is verified.The results can be easily generalized to other data association approaches under the same RFS framework.
