TY - GEN
T1 - Multi-task allocation of UCAVs considering time cost and hard time window constraints
AU - Zhang, Jian
AU - Peng, Zhihong
AU - Li, Bo
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
KW - Ant-Colony Algorithm
KW - MTSP
KW - UCAVs
KW - maximum execution time
KW - task allocation
UR - https://www.scopus.com/pages/publications/84873539690
M3 - Conference contribution
AN - SCOPUS:84873539690
SN - 9789881563811
T3 - Chinese Control Conference, CCC
SP - 2448
EP - 2452
BT - Proceedings of the 31st Chinese Control Conference, CCC 2012
T2 - 31st Chinese Control Conference, CCC 2012
Y2 - 25 July 2012 through 27 July 2012
ER -