Manned combat aerial vehicles （MCAVs）, and un-manned combat aerial vehicles （UCAVs） together form a cooper-ative engagement system to carry out operational mission, whichwill be a new air engagement style in the n...Manned combat aerial vehicles （MCAVs）, and un-manned combat aerial vehicles （UCAVs） together form a cooper-ative engagement system to carry out operational mission, whichwill be a new air engagement style in the near future. On the basisof analyzing the structure of the MCAV/UCAV cooperative engage-ment system, this paper divides the unique system into three hi-erarchical levels, respectively, i.e., mission level, task-cluster leveland task level. To solve the formation and adjustment problem ofthe latter two levels, three corresponding mathematical modelsare established. To solve these models, three algorithms calledquantum artificial bee colony （QABC） algorithm, greedy strategy（GS） and two-stage greedy strategy （TSGS） are proposed. Finally,a series of simulation experiments are designed to verify the effec-tiveness and superiority of the proposed algorithms.展开更多
基金supported by the National Natural Science Foundation of China(61573017)the Doctoral Innovation Found of Air Force Engineering University(KGD08101604)
文摘Manned combat aerial vehicles （MCAVs）, and un-manned combat aerial vehicles （UCAVs） together form a cooper-ative engagement system to carry out operational mission, whichwill be a new air engagement style in the near future. On the basisof analyzing the structure of the MCAV/UCAV cooperative engage-ment system, this paper divides the unique system into three hi-erarchical levels, respectively, i.e., mission level, task-cluster leveland task level. To solve the formation and adjustment problem ofthe latter two levels, three corresponding mathematical modelsare established. To solve these models, three algorithms calledquantum artificial bee colony （QABC） algorithm, greedy strategy（GS） and two-stage greedy strategy （TSGS） are proposed. Finally,a series of simulation experiments are designed to verify the effec-tiveness and superiority of the proposed algorithms.
