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

Authors:
P. P. A. Storms;F. C. R. Spieksma
Affiliations:
Acklin B.V., Parkstraat 1a, NL-4818 SJ Breda, Netherlands;Faculty of Economic and Applied Economic Sciences, Katholieke Universiteit Leuven, Naamsestraat 69, B-3000 Leuven, Belgium
Venue:
Computers and Operations Research
Year:
2003

Citing 3
Cited 8

Discrete optimization

Discrete optimization
Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking

Computational Optimization and Applications
A General Class of Greedily Solvable Linear Programs

Mathematics of Operations Research

A Process Distribution Approach for Multisensor Data Fusion Systems Based on Geographical Dataspace Partitioning

IEEE Transactions on Parallel and Distributed Systems
Sequential constraint augmentation with variable neighbourhood search for the multidimensional assignment problem

International Journal of Computational Science and Engineering
An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors

Discrete Applied Mathematics
Multi-index transport problems with decomposition structure

Automation and Remote Control
Multiindex transportation problems with 2-embedded structure

Automation and Remote Control
Approximation algorithms for data association problem arising from multitarget tracking

CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Approximation algorithms for data association problem arising from multitarget tracking

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Solving the Multidimensional Assignment Problem by a Cross-Entropy method

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this work we present a linear programming (LP) based approach for solving the data association problem (DAP) in multiple target tracking. It is well-known that the DAP can be formulated as an integer program. We present a compact formulation of the DAP. To solve practical instances of the DAP we propose an algorithm that uses an iterated K-scan sliding window technique. In each iteration we solve the LP relaxation of an integer program and next apply a greedy rounding procedure. Computational experiments indicate that the quality of the solutions found is quite satisfactory.