Modelling for combat task allocation problem of aerial swarm and its solution using wolf pack algorithm
by Hao Li; Renbin Xiao; Husheng Wu
International Journal of Innovative Computing and Applications (IJICA), Vol. 7, No. 1, 2016

Abstract: To cope with the combat task allocation problems of aerial swarm, firstly, the assumption of battlefield environment was made. And the two multi-attribute principal parts of battlefield, swarm aerocraft (SA) and attacked target (AT) were analysed respectively. Secondly, based on comprehensive consideration of stealth and anti-stealth, attack and counter attack, multi-vehicle cooperation, etc., the objective function was established after analysing the costs and benefits that SA taking the task of reconnaissance, attack and assessment. Then, the task allocation model with the characteristics of multi-target, multi-task, multi-constraint, heterogeneous multi-aerocraft was established after considering some constrains, such as ammunition limit, etc. Based on binary wolf pack algorithm and a novel integer coding method which can better convey the information of the model, an integer coding wolf pack algorithm (ICWPA) was proposed to solve the task allocation model. The simulation results show that the model and the algorithm can effectively solve the combat task allocation problem of aerial swarm.

Online publication date: Wed, 23-Mar-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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