A linear programming based algorithm for the data association problem in multitarget tracking

A linear programming based algorithm for the data association problem in multitarget tracking

0.00 Avg rating0 Votes
Article ID: iaor20033154
Country: United Kingdom
Volume: 30
Issue: 7
Start Page Number: 1067
End Page Number: 1085
Publication Date: Jun 2003
Journal: Computers and Operations Research
Authors: ,
Keywords: programming: integer, heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.