Simple Path Planning for Mobile Robots in the Present of Obstacles

To obtain the near optimal path for the mobile robots in the present of the obstacles, where the robots are subject to both the nonholonomic constraints and the bound to the curvature of the path, a simple planning is applied by the heuristic searching method in which Reeds and Shepp's shortest paths are chosen as heuristic functions. It has performed well in simulation of mobile robots moving in a cluttered environment.