摘要
A new troubleshooting algorithm for solving assignment problem based on existing algorithms is proposed, and an analysis on the related theory is given. By applying the new troubleshooting algorithm to the Lagrange relaxation algorithm of the multi-dimensional assignment problem of data association for multi-passive-sensor multi-target location systems, and comparing the simulation results with that of the Hungarian algorithm which is the classical optimal solving algorithm, and the multi-layer ordersearching algorithm which is a sub-optimal solving algorithm, the performance and applying conditions of the new algorithm are summarized. Theory analysis and simulation results prove the effectiveness and superiority of the new algorithm.
A new troubleshooting algorithm for solving assignment problem based on existing algorithms is proposed, and an analysis on the related theory is given. By applying the new troubleshooting algorithm to the Lagrange relaxation algorithm of the multi-dimensional assignment problem of data association for multi-passive-sensor multi-target location systems, and comparing the simulation results with that of the Hungarian algorithm which is the classical optimal solving algorithm, and the multi-layer ordersearching algorithm which is a sub-optimal solving algorithm, the performance and applying conditions of the new algorithm are summarized. Theory analysis and simulation results prove the effectiveness and superiority of the new algorithm.
基金
supported by the National Natural Science Foundation of China(61170161)
the Natural Science Foundation of S handong (ZR2009GM002)
the Technology Projects of Shandong University (J09LG01)