By Topic

A study on two novel ant estimators

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Benlian Xu ; Dept. of Autom., Changshu Inst. of Technol., Changshu ; Zhiquan Wang

Ant colony optimization (ACO) algorithm is usually utilized to solve various combinatorial optimization problems. In this work, however, two novel ant systems are developed to estimate the state of interest, and we call them ant estimators. The first ant estimator is based partly upon the idea of particle filter, while the latter depends on the movement of each ant. For each ant estimator, the ldquopheromonerdquo update equation is well defined in order to guide ants to better solutions. Finally, Monte-Carlo runs are conducted and the results indicate that the two ant estimator perform well in estimating state parameters. In particular, we find that both are capable of tracking maneuvering target without any auxiliary means when employed in the target tracking field.

Published in:

Industrial Electronics and Applications, 2009. ICIEA 2009. 4th IEEE Conference on

Date of Conference:

25-27 May 2009