UAVs cooperative task assignment and trajectory optimization with safety and time constraints

This paper proposes new methods and strategies for Multi-UAVs cooperative attacks with safety and time constraints in a complex environment.Delaunay triangle is designed to construct a map of the complex flight environment for aerial vehicles.Delaunay-Map,Safe Flight Corridor(SFC),and Relative Safe Flight Corridor(RSFC)are applied to ensure each UAV flight trajectory's safety.By using such techniques,it is possible to avoid the collision with obstacles and collision between UAVs.Bezier-curve is further developed to ensure that multi-UAVs can simultaneously reach the target at the specified time,and the trajectory is within the flight corridor.The trajectory tracking controller is also designed based on model predictive control to track the planned trajectory accurately.The simulation and experiment results are presented to verifying developed strategies of Multi-UAV cooperative attacks.

Coalition Formation for Multiple UAVs Cooperative Search and Attack with Communication Constraints in Unknown Environment

A coalition formation algorithm is presented with limited communication ranges and delays in unknown environment,for the performance of multiple heterogeneous unmanned aerial vehicles(UAVs)in cooperative search and attack missions.The mathematic model of coalition formation is built on basis of the minimum attacking time and the minimum coalition size with satisfying resources and simultaneous strikes requirements.A communication protocol based on maximum number of hops is developed to determine the potential coalition members in dynamic network.A multistage sub-optimal coalition formation algorithm(MSOCFA)with polynomial time is established.The performances of MSOCFA and particle swarm optimization(PSO)algorithms are compared in terms of complexity,mission performance and computational time.A complex scenario is deployed to illustrate how the coalitions are formed and validate the feasibility of the MSOCFA.The effect of communication constraints(hop delay and max-hops)on mission performance is studied.The results show that it is beneficial to determine potential coalition members in a wide and deep range over the network in the presence of less delay.However,when the delays are significant,it is more advantageous to determine coalitions from among the immediate neighbors.

Consensus of multi-vehicle cooperative attack with stochastic multi-hop time-varying delay and actuator fault

A consensus-distributed fault-tolerant(CDFT)control law is proposed for a class of leader-following multi-vehicle cooperative attack(MVCA)systems in this paper.In particular,the switching communication topologies,stochastic multi-hop timevarying delays,and actuator faults are considered,which may lead to system performance degradation or on certain occasions even cause system instability.Firstly,the estimator of actuator faults for the following vehicle is designed to identify the actuator faults under a fixed topology.Then the CDFT control protocol and trajectory following error are derived by the relevant content of Lyapunov stability theory,the graph theory,and the matrix theory.The CDFT control protocol is proposed in the same manner,where a more realistic scenario is considered,in which the maximum trajectory following error and information on the switching topologies during the cooperative attack are available.Finally,numerical simulation are carried out to indicate that the proposed distributed fault-tolerant(DFT)control law is effective.

One-to-Any Command and Control Model:Precisely Coordinated Operation on Uncooperative Controlled Nodes

New precisely cooperative attacks, such as the coordi- nated cross plane session termination （CXPST） attack, need thou- sands upon thousands machines to attack diverse selected links simultaneously with the given rate. However, almost all command and control（C＆C） mechanisms only provide publishing one com- mand to the whole once, so-called one-to-all C＆C model, and are not productive to support CXPST-alike attacks. In this paper, we present one-to-any C＆C model on coordination among the unco- operative controlled nodes. As an instance of one-to-any C＆C model, directional command publishing （DCP） mechanism lever- aging on Kademlia is provided with a range-mapping key creating algorithm for commands to compute the publishing range and a statistically stochastic node querying scheme to obtain the com- mands immediately. With theoretical analysis and simulation, it is indicated that one-to-any C＆C model fits for precisely coordi- nated operation on uncooperative controlled nodes with least complexity, better accuracy and efficiency. Furthermore, DCP mechanism can support one-to-all command publishing at the same time. As an example of future C＆C model, studying on one-to-any C＆C model may help to promote the development of more efficient countermeasures.

HEURISTIC QUANTUM GENETIC ALGORITHM FOR AIR COMBAT DECISION MAKING ON COOPERATIVE MULTIPLE TARGET ATTACK

In order to achieve the optimal attack outcome in the air combat under the beyond visual range(BVR)condition,the decision-making(DM)problem which is to set a proper assignment for the friendly fighters on the hostile fighters is the most crucial task for cooperative multiple target attack(CMTA).In this paper,a heuristic quantum genetic algorithm(HQGA)is proposed to solve the DM problem.The originality of our work can be supported in the following aspects:(1)the HQGA assigns all hostile fighters to every missile rather than fighters so that the HQGA can encode chromosomes with quantum bits(Q-bits);(2)the relative successful sequence probability(RSSP)is defined,based on which the priority attack vector is constructed;(3)the HQGA can heuristically modify quantum chromosomes according to modification technique proposed in this paper;(4)last but not the least,in some special conditions,the HQGA gets rid of the constraint described by other algorithms that to obtain a better result.In the end of this paper,two examples are illustrated to show that the HQGA has its own advantage over other algorithms when dealing with the DM problem in the context of CMTA.