Improved the Heuristic Search Algorithm based B-tree
Wang Hu · Engineering of Surveying and Mapping · 2014
the shortest path is one of the hot issues of the modern logistics and distribution,On the basis of analyzing tradition A* algorithm,achieve the shortest path between nodes based on B-tree,during selecting the next check node,introduce the global information,And estimate of the current and the end node,It searches the shortest path within the sector limit because searching area and searching direction are limited,to improve the efficiency of the search process,Experimental verification the improved A*algorithm improve efficiency by 11%-26%than A*