The invention relates to a local path
planning method based on a dynamic window method and suitable for an Ackerman model
robot. The method comprises the steps of: firstly, acquiring the posture of the
robot and the position of an obstacle according to a sensor carried by the
robot, then calculating the coordinates of an
obstacle avoidance starting point and coordinates and direction of a local target point, and determining a final speed space; meanwhile, segmenting the
obstacle avoidance process of the robot to determine evaluation functions, judging the number of segments in segmented
obstacle avoidance at present, and selecting the corresponding
evaluation function for
processing to obtain the speed corresponding to the minimum
evaluation function value to serve as the optimal speed ofrobot operation, and repeatedly executing the obtained optimal speed, judging whether the robot reaches a local target point or not according to the current position of the robot, and if so, ending obstacle avoidance; conducting local path planning according to the size and position of the obstacle, the robot speed and the minimum
turning radius, and promoting the robot to move in an optimal pathon the premise that the robot can avoid the obstacle and can return to a global path in a smooth direction after obstacle avoidance is finished.