Answers are grounded in this paper and cite their sources.
To address the problems that the traditional A* algorithm often fails to obtain the optimal solution when performing path planning leading to increased search cost, more nodes to be searched, more inflection points of the planned path, and easy access to local optimal solutions, two methods of improving the heuristic function of the A* algorithm are used. The first one is to dynamically weight the heuristic function, and the second one is to use different heuristic functions in segments. The simulation results show that these two methods can effectively solve the problems of reducing the cost, reducing the inflection point, and avoiding entering the local optimal solution as much as possible. Also in the deepening of the learning of the A* algorithm, improvements are made in parts other than the heuristic function.
No takes yet. Share an insight, caveat, or question.
A 2022 study studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: