Conclusion

In this paper we describe a time-recursive K-track L-list Viterbi algorithm for MAP measurement-to-track association. This algorithm can handle missed detections, false alarms and track initialization. Compared to direct computation of the solution of the MAP problem, this algorithm manages computational cost by time recursively eliminating from further consideration hypothesized track sets which have too great a MAP cost.