Improved A* path-finding algorithm based on DEM-Grid
Xin Li · Jisuanji gongcheng yu sheji · 2011
To deal with Path-Finding problem based on DEM-Grid,the difference and sameness between DEM-Grid and road topo-network are analyzed,and the advantage and disadvantage between Dijkstra and A* algorithm on solving the problem are compared.An improved A* path-finding algorithm based on DEM-Grid is proposed.To reduce the complexity of Path-Finding algorithm,the attainable conditions on DEM-Grid are fully considered,the Moving-Window method is used to get candidate sets,an evaluation function of A* algorithm considering the geography space characters is employed,and a greedy rule is imported.Finally,the feasibility and validity of the algorithm are validated by practical application.