Improved A～ Algorithm of Flight Vehicle Path Planning Based On Time Complexity
Xin Peng · Microcomputer Information · 2012
Not only it needs long time and huge memory to converge to optimal solution but also the generated track can 't meet the constraint conditions of flight vehicle while in the process of using A algorithm to search for track in large map.Put forward an improved A search algorithm according to the basic operations which influence the calculating time most through analyzing the time complexity of A algorithm.The search algorithm makes sure the size of grid according to the error of navigation accuracy,digital map and so on and greatly reduces the search range in the process of expand child nodes through combining the track constraint and mission constraint of flight vehicle itself.The simulation shows that the search algorithm can not only plan the optimal track which meets the constraint conditions but also greatly reduces the searching time in huge varied topography.