Authors: Xiaoxue Feng; Yan Liang; Lianmeng Jiao
Addresses: School of Automation, Northwestern Polytechnical University, Xian 710129, China ' School of Automation, Northwestern Polytechnical University, Xian 710129, China ' School of Automation, Northwestern Polytechnical University, Xian 710129, China
Abstract: Data association is an essential part of track maintenance in multiple target tracking, which can be solved by multidimensional assignment methods. When there is a need to solve the multidimensional assignment problem, the ant colony optimisation (ACO) algorithm stands out as it can solve combinatorial optimisation problem with excellent performance in acceptable CPU time. Here, each measurement is modelled as an ant, each track is modelled as a city, and the problem of data association is modelled as the food locating by ants. Thus, a novel data association based on an improved ant colony optimisation algorithm (ACODA) is proposed in this paper. The detailed corresponding relationship and theoretical analysis between basic ACO algorithm and the ACODA algorithm are given. Simulation results show that as the number of targets increases, the ACODA algorithm performs better than JPDA and NN, with superior performance both in computational time and accuracy.
Keywords: data association; multidimensional assignment; ant colony optimisation; ACO; target tracking; multiple targets; combinatorial optimisation; simulation.
International Journal of Wireless and Mobile Computing, 2013 Vol.6 No.3, pp.299 - 304
Available online: 06 Aug 2013 *Full-text access for editors Access for subscribers Purchase this article Comment on this article