Improved assignment with ant colony optimization for multi-target tracking

doi:10.1016/j.eswa.2011.01.134

Return

Improved assignment with ant colony optimization for multi-target tracking

2011-08-01

PRE

Murat Efe *

DOI：10.1016/j.eswa.2011.01.134

Original

Original request for help

Save

Abstract

En 中文

Detecting and tracking ground targets is crucial in military intelligence in battlefield surveillance. Once targets have been detected, the system used can proceed to track them where tracking can be done using Ground Moving Target Indicator (GMTI) type indicators that can observe objects moving in the area of interest. However, when targets move close to each other in formation as a convoy, then the problem of assigning measurements to targets has to be addressed first, as it is an important step in target tracking. With the increasing computational power, it became possible to use more complex association logic in tracking algorithms. Although its optimal solution can be proved to be an NP hard problem, the multidimensional assignment enjoyed a renewed interest mostly due to Lagrangian relaxation approaches to its solution. Recently, it has been reported that randomized heuristic approaches surpassed the performance of Lagrangian relaxation algorithm especially in dense problems. In this paper, impelled from the success of randomized heuristic methods, we investigate a different stochastic approach, namely, the biologically inspired ant colony optimization to solve the NP hard multidimensional assignment problem for tracking multiple ground targets. (C) 2011 Elsevier Ltd. All rights reserved.

Keywords:

Multidimensional assignment

Ant colony optimization

Multiple target tracking

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.