Research On Key Technologies Of Multi-plane Joint Task Collaborative Assignment

The carrier-based fleet is the core force of aircraft carrier attack and defense,the joint operation of multiple aircraft types is the basic operational style.The tasks performed by the carrier aircraft are mostly complex and require multiple flight platforms to participate together,while the carrier aircraft also participates in multiple missions during the combat process.Therefore,it is necessary to properly allocate the platform at what time to perform tasks to improve operational efficiency.A joint task is a task in which multiple platforms participate and the platforms' functions are different.At present,the research on multi-plane coordination mostly refers to the isomorphism of the flight platform,or the platform is heterogeneous but can bear the same function.It has not been seen that the platform only undertakes part of the allocation problem.This thesis studies the joint task assignment problem,the main work includes:(1)Established a model for joint task assignment problems.The joint task and the combat platform are described.The platform and task matching matrix and the task topology are used to describe the results of the task assignment.The joint task assignment problem is divided into two types: pre-allocation and redistribution,and the complexity of the problem is analyzed..The current research ignores the shortcomings of the platform's operational radius,and considers the operational radius of the platform when estimating the platform's range.(2)When solving the joint task pre-allocation problem,the ant colony algorithm is improved to the multi-pheromone ant colony algorithm,the pheromone type and the number of ants are increased,and the ant movement,heuristic function and pheromone update strategy in the algorithm are changed..The MATLAB simulation experiment proves that for a set of tasks and platforms,the algorithm can obtain effective allocation results.Compared with the genetic algorithm of greedy strategy,when the number of tasks is large,the algorithm has a great advantage in solving the effect.(3)When solving the problem of joint task redistribution,the four situations that cause the task redistribution are analyzed.Considering the waiting time of the platform and the additional flight of the platform to insert a new task,these four situations are proposed.The solution is adjusted on the basis of the original allocation scheme to adapt to the unexpected situation.The MATLAB simulation experiment proves that several emergencies can be adjusted to obtain effective new schemes based on the original scheme,and the other parts of the original scheme are not changed too much.