Research Of Missile Route Planning Algorithm Based On A* Algorithm

Route planning is to plan a satisfactory flight path for the aircraft within a certain period of time,under the consideration of the flightenvironment of the aircraft,its own constraints,mission requirements and the flightable area,at the purpose of ensuring the completion of the flight and the realization of the strike mission.The route planning process involves many variables,and it's difficult to find the optimal path and the calculation cost too much time.To achieve the goal perfectly,it is necessary to establish an accurate model of route planning and digitize the target through a good algorithm program.In this paper,the research object is the subsonic cruise missile.The rearch is carried out in the aspects of the modeling of route planning problem,the single track planning algorithm and the multi-track algorithmd,providing a new idea and solution for the route planning algorithm improvement.According to the background of the paper,confirming the method of the space construction of route planning and the description strategy of the threat zone.Based on the flight characteristics of cruise missile,calculating the relationship between overload and maximum curvature radius,establishing the model of the node expansion,expounding the function of path evaluation.Evaluing the advantages and disadvantages of existing path evaluation function.According to the backgroung of application,establishing a model of path evaluation function.Establishing the principle and flow mathematical model of route planning method based on A* algorithm and SAS algorithm,which provides theoretical basis for later research.In the research of single route planning,aimed at the problem of the loss of path authenticity caused by node reduction,a method of minimum cost matrix is proposed,and the simulation results are analyzed,which proves that the method can effectively guarantee the authenticity and the optimality of routes.Proposing a establishing method of heuristic function model.Taking the intermediate point in the threat area as the route point of the predicted path,the extended nodes are planned with the double-layer A* algorithm to reduce the invalid node expansion,realizing the function of "predicting" the threat and resulted in improving the efficiency of route planning.Results of the simulation show that the improved method is effective in the efficiency improving of route planning.In the research of multi-route planning,in order to solve the problem of the length of initial path point chain which must be consistent,according to K-means clustering algorithm,this paper analyzes the method of dividing tracks proposed in literature and proposes a method to ensure the length of route point chain by inserting nodes.Aiming at the problem of initial path generation,a rapid method based on secondary starting point and secondary target point of route is proposed.Describing the rules of establishing visibility list and through the simulation,verifing the feasibility of initial route generation,determing the initial routes,finally.Based on the determined initial routes,Evolutionary Multiple Route Planner(EMRP)algorithm is used to simulating and analyzing,and realized the generation of multi-route planning,verifying the feasibility of the improved method.