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

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.