Bio-inspired optimisation approach for data association in target tracking Online publication date: Sat, 11-Oct-2014
by Xiaoxue Feng; Yan Liang; Lianmeng Jiao
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 6, No. 3, 2013
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook