Conventional algorithms for track association (termed "correlation" by convention) employ algorithms which are applied to all sensor tracks at a specific time. The overall value of sensor networks for data fusion is closely tied to the reliability of correct association of common objects tracked by the sensors. Multisensor architectures consisting of gaps in target coverage requires that tracks must be propagated substantially forward or backward to a common time for correlation. This naturally gives rise to the question: at which time should track correlation be performed? In the conventional approach, a two-sensor correlation problem would be solved by propagating the first sensor's tracks forward to the update time (current time) of the tracks from the second sensor. We question this approach by showing simulation results that indicate that the current time can be the worst time to correlate. In addition, a methodology for calculating the approximate optimal correlation time for linear-Gaussian tracking problems is provided.
[1]
X. R. Li,et al.
Performance Prediction of the Interacting Multiple Model Algorithm
,
1992,
1992 American Control Conference.
[2]
Shawn M. Herman,et al.
Efficiency and sensitivity of methods for assessing ambiguity in data association decisions
,
2008,
SPIE Defense + Commercial Sensing.
[3]
Thia Kirubarajan,et al.
Estimation with Applications to Tracking and Navigation: Theory, Algorithms and Software
,
2001
.
[4]
X. R. Li,et al.
Performance Prediction of the Interacting Multiple Model Algorithm
,
1992
.
[5]
Yaakov Bar-Shalom.
Update with out-of-sequence measurements in tracking: exact solution
,
2002
.
[6]
William Dale Blair,et al.
Fixed-gain two-stage estimators for tracking maneuvering targets
,
1993
.