Multitarget tracking via mixed integer optimization
D Bertsimas, Z Saunders… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
Given a set of target detections over several time periods, this paper addresses the
multitarget tracking (MTT) problem of optimally assigning detections to targets and
estimating the trajectory of the targets over time. MTT has been studied in the literature via
predominantly probabilistic methods. In contrast, we propose the use of mixed integer
optimization (MIO) along with relaxations and local-search-based heuristic algorithms that
are: scalable, as they provide near optimal solutions for six targets and ten time periods in …
multitarget tracking (MTT) problem of optimally assigning detections to targets and
estimating the trajectory of the targets over time. MTT has been studied in the literature via
predominantly probabilistic methods. In contrast, we propose the use of mixed integer
optimization (MIO) along with relaxations and local-search-based heuristic algorithms that
are: scalable, as they provide near optimal solutions for six targets and ten time periods in …
Multi-target tracking via mixed integer optimization
ZC Saunders - 2016 - dspace.mit.edu
Given a set of target detections over several time periods, this paper addresses the multi-
target tracking problem (MTT) of optimally assigning detections to targets and estimating the
trajectory of the targets over time. MTT has been studied in the literature via predominantly
probabilistic methods. In contrast to these approaches, we propose the use of mixed integer
optimization (MIO) models and local search algorithms that are (a) scalable, as they provide
near optimal solutions for six targets and ten time periods in milliseconds to seconds,(b) …
target tracking problem (MTT) of optimally assigning detections to targets and estimating the
trajectory of the targets over time. MTT has been studied in the literature via predominantly
probabilistic methods. In contrast to these approaches, we propose the use of mixed integer
optimization (MIO) models and local search algorithms that are (a) scalable, as they provide
near optimal solutions for six targets and ten time periods in milliseconds to seconds,(b) …
以上显示的是最相近的搜索结果。 查看全部搜索结果