Optimization methods for A* and D* algorithms

Abstract

With the Internet industry's development and the economy's rapid growth, the logistics industry has been overgrowing in recent years. It plays an irreplaceable role in the institutions of economic systems worldwide. However, the A* algorithm and the D* algorithm, which currently dominate the logistics industry's path planning algorithms, still have problems, such as long planning times and long planning paths, and there is much room for optimization. Starting with the conventional A* and D* algorithms, this study improves the planning times of the former by enhancing the heuristic function and the latter by increasing the judgment condition. After verification, the average optimization rate of both improved methods reaches more than 5%, improving the transport efficiency of the logistics industry.