Multi-task allocation of UCAVs considering time cost and hard time window constraints

Author

Jian, Zhang ; Zhihong, Peng ; Bo, Li

Author_Institution

Sch. of Autom., Beijing Inst. of Technol., Beijing, China

fYear

2012

fDate

25-27 July 2012

Firstpage

2448

Lastpage

2452

Abstract

A scenario of multiple targets which need to be assigned to different UCAVs from different military bases has been established. The maximum execution time, hard time window, timing constraints, Maximum execution number of tasks, Speed and voyage loss were taken into consideration in this tasks allocation problem. Through the uses of Ant-Colony Algorithm based on MTSP (Multiple Traveling Salesman Problem), the optimization problem had been solved efficiently, which made it more practical. Simulation results show that the proposed method is able to provide a reasonable project in a short time.

Keywords

ant colony optimisation; autonomous aerial vehicles; military systems; mobile robots; telerobotics; travelling salesman problems; MTSP; UCAV; ant colony algorithm; hard time window constraints; military bases; multiple traveling salesman problem; multitask allocation; time cost window constraints; unmanned combat aerial vehicle; Algorithm design and analysis; Optimization; Resource management; Traveling salesman problems; Unmanned aerial vehicles; Vehicle dynamics; Ant-Colony Algorithm; MTSP; UCAVs; maximum execution time; task allocation;

fLanguage

English

Publisher

ieee

Conference_Titel

Control Conference (CCC), 2012 31st Chinese

Conference_Location

Hefei

ISSN

1934-1768

Print_ISBN

978-1-4673-2581-3

Type

conf

Filename

6390336