A-star(A*) algorithm based on MATLAB

The A* algorithm is an efficient direct search algorithm for finding the shortest path in a static network. When facing relatively complex environments, the A* algorithm needs to be improved if the ordinary A* algorithm cannot be solved or runs too slowly. In this paper, we will optimise and improve the A* algorithm based on the principle of A* algorithm through two different schemes, namely multipath planning and weighted computation. Multipath planning is the process of converting a complex problem into multiple simpler sub-problems, which can be understood as artificially setting one or more intermediate points between the start and end points. The weighted computation of the A* algorithm is used to calculate the estimated distance by adjusting the weights according to the current environment, and optimisation is achieved by updating the weights between nodes in real time. In addition, this paper also uses Matlab simulation to compare the running speed of the two improved algorithms with the original algorithm. Through a large number of simulation experiments, it is finally verified that the improved algorithm is faster than the original algorithm in terms of the root-mean- square of the running speed, and both optimisation methods can achieve the improvement of the A* algorithm.