By Topic

Evolutionary Tabu Search in Task Allocation of Unmanned Aerial Vehicles

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)
Ping Yan ; Inst. of software, Chinese Acad. of Sci., Beijing ; Changwen Zheng

This paper addresses the problem of task allocation problem for a fleet of unmanned aerial vehicles (UAVs). An evolutionary tabu search (TS) algorithm is proposed to search the optimal solution to the task allocation problem. In this algorithm, TS serves as the mutation operator in evolutionary algorithm. Evolutionary computation (EC) gives appropriate initial value and TS helps to find a better solution. In order to meet the requirements of task reallocation in dynamic environment, a partially regroup strategy based on K-mean clustering is employed to find the new solutions in real time while keeping the optimality of results. Our algorithm incorporates domain-specific knowledge and takes into account different kinds of mission constraints. Simulation results validate the feasibility and efficiency of our algorithm

Published in:

Computational Engineering in Systems Applications, IMACS Multiconference on  (Volume:1 )

Date of Conference:

4-6 Oct. 2006