Abstract
The aim of this work is to propose a semigreedy algorithm for solving the data association problem (DAP) arising in multitarget tracking. The DAP is characterized as a maximum weighted set partitioning problem (MWSPP). A semigreedy algorithm that first generates a number of different solutions using a polynomial number of operations and then selects the best among the solutions generated is presented. Theoretically we prove that the value of the solution returned by the algorithm approximates the value of the optimal solution within a guaranteed factor. This factor only depends on the dimension of the sliding window used. Computational experiments indicate that the quality of the solutions returned is quite satisfactory.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Aerospace and Electronic Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
