By Topic

Cooperative task allocation for Unmanned Combat Aerial Vehicles using improved ant colony algorithm

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

3 Author(s)
Jun Tao ; Coll. of Commun. Eng., Jilin Univ., Changchun ; Yantao Tian ; Xiangheng Meng

Task allocation plays an important role in unmanned combat aerial vehiclespsila (UCAVs) cooperative control. In order to solve the problem of multiple UCAVspsila cooperative task allocation, an improved ant colony algorithm (ACA) is proposed. On the basis of modeling cooperative multiple task assignment problem, the application of improved ACA is discussed. Cooperative task allocation for UCAVs shows a property of dynamic multiple phased decision problems and a task tree is used to represent that case. In the improved ACA, pheromone change is very different from other classic improved ACA. Especially when pop-up targets appear, with the help of changed pheromone matrix which is gained from former iterations, it becomes easier and quicker to find good solutions.

Published in:

Cybernetics and Intelligent Systems, 2008 IEEE Conference on

Date of Conference:

21-24 Sept. 2008