Research On Path Planning Model And Algorithm Of Anti-ship Missile Based On Dynamic Programming

Path planning is the technical guarantee to realize missile autonomous flight and improve missile penetration capability.As the core of path planning technology,the advantages and disadvantages of the algorithm for path planning directly affect the success or failure of combat missions.Therefore,it is of great significant to study the path planning algorithm.This paper establishes the mathematical model of anti-ship missile path planning and studies the application of dynamic programming algorithm in anti-ship missile path planning.The main works are as follows:1.Based on multi-objective optimization method,a multi-constrained and weak-coupling mathematical model of anti-ship missile path planning is constructed.By the continuous mathematical model of the anti-ship missile path planning,this paper considers the actual flight characteristics and flight requirements of the missile,analyzes the operational environment and maneuverability,and selects the appropriate evaluation function.Finally,a discrete mathematical model for path planning is build,which can solve pratical problems quickly and efficiently.2.Aiming at the problem that the dynamic programming algorithm consumes a long time in the two-dimensional path planning of anti-ship missiles,we propose a bidirectional dynamic programming algorithm whose global optimality is proved by the Bellman optimality principle.Upon dynamic programming algorithm,we consider the characteristics of path planning,and establish a path planning model,in which the dynamic programming algorithm,ant colony algorithm,simulated annealing algorithm and bidirectional dynamic programming algorithm are respectively used for results.In this paper,the number of state points involved in the calculation is fewer,the time consuming is shorter,and the trajectory planning can remain optimal.3.By considering the influence of the number of missile turns on navigation accuracy and survival probability,a flight optimization strategy based on triangular inequality is proposed.According to the geometric property that the sum of the two sides of the triangle is larger than the third side,the trajectory obtained by the bidirectional dynamic programming algorithm is optimized twice.Compared with the pre-optimized trajectory,the optimized trajectory with the proposed strategy has few-er nodes and is more conducive to the actual flight of the missile while maintaining the feasibility of the trajectory.4.To solve the problem that the dynamic programming algorithm may lead to "dimension disaster" in the three-dimensional path planning of anti-ship missiles,a dynamic programming-ant colony algorithm is proposed,and the global optimality of the algorithm is analyzed by using probability theory.This algorithm combines the split characteristic of dynamic programming algorithm and the parallelism of ant colony algorithm,which can not only reduce the probability of ant colony algorithm falling into local optimum,but also avoid the "dimension disaster" of dynamic programming algorithm to a certain extent.To verify the performance of the algorithm,the function method is used to simulate the generation of terrain data and carry out simulation experiments.The results show that dynamic programming-ant colony algorithm can converge to the global optimal solution more quickly by comparing with the dynamic programming algorithm and ant colony algorithm.