Research And Implemention Of K Optimal Path Planning Algorithm Based On GIS For Large Scaledata

Path planning problem is one of the key contents in the research field of Geographic Information System(GIS), among which the finding of the shortest path is always a hot topic. under large-scale data, the efficiency of traditional algorithms of Kth shortest paths is relatively low, and some path problems concerning big difference between the planned Kth paths under actual requirements cannot be solved. Dijkstra’s algorithm was employed for preprocessing, applying the concepts of favourability and repeatability. Through examination of the repeatability of the path results and changes in the graph caused by adjustments made to the favourability, the A* algorithm was used repeatedly to identify the optimal paths in the current geographic information system graph. Compared with similar algorithms, this algorithm is faster, and the multiple path results obtained meet the requirement for certain repeatability while the lengths of paths are also quite reasonable. At the same time, according to the problem of the low efficiency of the whole path planning system, the map cache is put forward, and the overall efficiency of path planning system is optimized.