Research on robot indoor automatic navigation algorithm

This paper first analyzes and compares the Dijkstra algorithm and the A* algorithm based on graph theory under the global path planning, and the comparison results show that the A* algorithm is more efficient than the Dijkstra algorithm. This paper uses the bidirectional path search strategy, evaluation function optimization and Open set optimization to improve the A* algorithm, and compares the traditional A* algorithm and the optimized A* algorithm by using MATLAB, and draws the conclusion that the improved A* algorithm has higher efficiency but more memory consumption.