Research on Path Planning method for Intelligent Vehicle

This paper proposes A dynamic switching strategy based on Dijkstra algorithm and A * algorithm. By setting a threshold, the dynamic switching algorithm according to the distance can improve the efficiency of path planning. Compared with the traditional global and local path planning methods, this paper innovates to use Dijkstra algorithm for global path search, and switch to A * algorithm when it is close to the target node, so as to achieve a balance between global optimality and computational efficiency. In addition, the artificial potential field method is improved to overcome the local optimum and path oscillation problems of the traditional method. The experimental results show that the proposed algorithm has significant advantages in real-time performance and path smoothness in complex environments.