Computing budget allocation for efficient ranking and selection of variances with application to target tracking algorithms

摘要

This paper addresses the problem of ranking and selection for stochastic processes, such as target tracking algorithms, where variance is the performance metric. Comparison of different tracking algorithms or parameter sets within one algorithm relies on time-consuming and computationally demanding simulations. We present a method to minimize simulation time, yet to achieve a desirable confidence of the obtained results by applying ordinal optimization and computing budget allocation ideas and techniques, while taking into account statistical properties of the variance. The developed method is applied to a general tracking problem of Ns sensors tracking T targets using a sequential multi-sensor data fusion tracking algorithm. The optimization consists of finding the order of processing sensor information that results in the smallest variance of the position error. Results that we obtained with high confidence levels and in reduced simulation times confirm the findings from our previous research (where we considered only two sensors) that processing the best available sensor the last performs the best, on average. The presented method can be applied to any ranking and selection problem where variance is the performance metric.