Investigation of a multiple passive sensor tracking algorithm
暂无分享,去创建一个
In this paper, we discuss the implementation of a multiple passive sensor tracking algorithm using a graph theoretic method. The sensor to sensor data association problem is formulated and solved as a minimum cost multiple node-disjoint path problem.
[1] J. W. Suurballe. Disjoint paths in a network , 1974, Networks.
[2] Stephan Kolitz. Passive-sensor data fusion , 1991, Defense, Security, and Sensing.
[3] Jack K. Wolf,et al. Finding the best set of K paths through a trellis with application to multitarget tracking , 1989 .
[4] D. Castañón. Efficient algorithms for finding the K best paths through a trellis , 1990 .
[5] Y. Bar-Shalom,et al. A new relaxation algorithm and passive sensor data association , 1992 .