A new approach based on Bezier curves to solve path planning problems for mobile robots

Path planning algorithms are used in known environments to find the shortest, smooth and optimal way without collision from the starting point to the target point. However, excessive nodes and pointed spiking points that occur during this path planning process pose problems. Bezier curves offer highly effective possibilities for path forming problems. In this article, a new approach based on Bezier curves is proposed for solving such problems. First, grid maps are used to model the environment Second, a path is found between the start and endpoints using traditional algorithms. Third, the excess knots are discarded by pruning based on Bezier curves. Finally, the spikes are smoothed using Bezier curves to ensure smoothness and continuity. Looking at the results from the proposed approach, it has proven that its effectiveness in obtaining an optimum path between the starting and target points in known environments. © 2021 Elsevier B.V.