\input zb-basic
\input zb-ioport
\iteman{io-port 00800362}
\itemau{Bojilov, L.V.}
\itemti{Some algorithms for solving assignment problem in multisensor multitarget tracking.}
\itemso{C. R. Acad. Bulg. Sci. 47, No.12, 65-68 (1994).}
\itemab
The paper deals with an assignment problem in dimension three. A set of measurements, obtained from multiple targets, in Cartesian coordinates, is considered. No missing detections and no false alarms are assumed. The problem is formulated as a partitioning of the measurements in triples, such that each measurement originates from one and the same target. Gaussian statistics for each measurement are assumed. As a measure of similarity the Mahalanobis distance is used. To solve the assignment problem, three algorithms are proposed. Based on a heuristic strategy, a suboptimal decision is achieved. It is shown, that using an extension of Munkers' assignment algorithm, a suboptimal solution to the problem can be obtained. Based on Monte Carlo simulation, the obtained algorithms are compared. With more than 1000 runs, the efficiency of the algorithms is illustrated.
\itemrv{T.Semerdjiev (Sofia)}
\itemcc{}
\itemut{data association; assignment problem; multiple targets}
\itemli{}
\end