Research on Shortest Path Planning and Smoothing Without Obstacle Collision Based on Moving Carrier

Abstract

In response to the challenges of path planning in complex scenarios, to overcome the influence of optimal path determination by the precision of grid map sizes, and to escape the uncertainty in solving by intelligent algorithms, this paper designs a method for obtaining an adjacency matrix based on node planning of shortest path diagrams with polygonal obstacles and then uses the Dijkstra algorithm to get the shortest path. For irregular curved obstacles, an edge straightening method is proposed. To enhance the applicability of the path, this paper introduces the constraint of minimum turning radius. It researches path smoothing under obstacle conditions based on arcs and straight lines, providing practical solutions for different scenarios. Considering the need to maintain a safe distance due to the size of the moving carrier and the deviation in trajectory tracking, this paper conducts an expansion analysis of obstacles. It obtains the trajectory on the arc after edge straight line fitting, followed by further smoothing treatment. The method proposed in this paper demonstrates excellent accuracy and robustness in path planning through simulation verification, proving its practicality and effectiveness in complex environments.