An LP-based algorithm for the data association problem in multitarget tracking.

DOI10.1016/S0305-0548(02)00057-6zbMath1039.90020MaRDI QIDQ1423449

P. P. A. Storms, Frits C. R. Spieksma

Publication date: 14 February 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

Linear programmingData associationMultitarget tracking

Mathematics Subject Classification ID

Search theory (90B40) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (10)

Branch and bound solution of the multidimensional assignment problem formulation of data association ⋮ Efficient sensor network management for asset localization ⋮ Multiindex transportation problems with 2-embedded structure ⋮ Dynamic discrete tomography ⋮ Data association approaches in bearings-only multi-target tracking ⋮ Multi-index transportation problems with 1-nested structure ⋮ Polyhedral combinatorics of multi-index axial transportation problems ⋮ Multi-index transport problems with decomposition structure ⋮ Solving the multidimensional assignment problem by a cross-entropy method ⋮ An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
• A binary-rounding heuristic for multi-period variable-task-duration assignment problems
• A General Class of Greedily Solvable Linear Programs
• A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking
• Application of 0-1 integer programming to multitarget tracking problems
• Letter to the Editor—The Multidimensional Assignment Problem

This page was built for publication: An LP-based algorithm for the data association problem in multitarget tracking.