Year: 2007
Type: conference-paper
Abstract: This paper mainly studies on the valid solution algorithm for multidimensional assignment problem of data association, proposes a heuristic searching algorithm for multidimensional assignment problem on the basis of order-searching algorithm and m-best algorithm, and presents a heuristic searching genetic algorithm for multidimensional assignment by fusing the heuristic searching algorithm and the genetic algorithm efficiently.The later algorithm can not only search the whole solution space quickly and efficiently by using the heuristic searching algorithm, but also can memorize and improve the better solution obtained in the initial step by using cross and mutation operations.So the convergence speed is accelerated and the accuracy of the convergence is improved.Simulation results show that the new algorithms are feasible and effective.
Author: Li Zhou
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W1997505477
