Method for finding solutions for the association problem in multiple-moving-target tracking

摘要

The method according to the invention belongs to the class of search methods for optimizing combinatorial optimization problems. Deterministic as well as more or less randomized searches can be carried out. Starting from a more or less randomly chosen, but valid mapping matrix, a new mapping matrix is generated. Then it is checked whether this represents a better solution than the old assignment matrix. If this is the case, this matrix is adopted as the new starting point for the further search. If this is not the case, the old assignment matrix is retained as the starting point for the further search. This procedure is continued until the time provided for the solution has expired, or until the method itself determines that no better solution can be found within the currently implemented search. IMAGE