Study On Cooperating Fire Strike Task Planning Problem Of Multi-weapon Platforms

With the change of modern information warfare,the combat forces become more and more systematic.And the cooperative operation of multi-weapon platforms is a main feature of combat SoS.For the new form of war,the new technology will be needed.Through task planning,an action plan which can achieve combat mission is generated by conside ring battlefield situation,operational resources and task requirements together.Based on this goal,faced with cooperative fire strike of multi-weapon platforms,this dissertation focuses on time planning of multiple tasks and task assignment problem.The major work of this dissertation can be concluded as follows:(1)Establishing a mathematical mode l and a solving framework of cooperating firepower strike task planning problem of multi-weapon platformsCooperating firepower strike task planning problem of multi-weapon platforms is analyzed and decomposed hierarchically.A mathematical mod el of this prob lem is founded to describe its basic assumptions,basic concepts,constraint conditions and objective function.Based on analys is of this mathematical mode l,a basic solving framework is proposed.(2)Study on time planning method of multiple fire strike tasks based on simple temporal constraint networkThrough analyzing and quantitatively describe time window constraints of fire strike tasks themselves and time collaborative constraints between tasks,a simple temporal constraint network is generated.By transforming the simple temporal constraint network into a distance graph,Floyd-Warshall algorithm is applied to calculate the shortest pa th matrix of the distance graph to check the consistency of this simple temporal constraint network.By analyzing the cons istency of this simple temporal constraint network,the solvability of this time constraint problem and taking value interval of each time point can be determined.(3)Study on weapo n-target assignment method based on discrete particle swarm optimization algorithmAccording to the information updating mechanism of the particle swarm optimization algorithm,a discrete particle swarm optimization algorithm for solving the constrained weapon-target assignment problem is proposed by introducing the crossover and mutation operators of the evolutionary computation into the particle swarm optimization algorithm.The discrete particle swarm optimization algorithm faced with discrete character of the constrained weapon-target assignment problem,extends the standard particle swarm optimization algorithm from continuous space to discrete space.Parameters of this discrete particle swarm optimization algorithm are optimized according to orthogonal design.For solving the constrained weapon-target assignment problem,the optimal performance of this discrete particle swarm optimization algorithm is compared with the optimal performance of the general ge netic algorithm,the improved genetic algorithm and the rounding particle swarm optimization algorithm.(4)Study on application in joint fire strikeThe joint fire strike is used as a background of the application research and a joint fire strike solution is generated.The application explains the feasibility and effectiveness of the methods in this dissertation.