Abstract:The path problem of shortest time for wheeled robots avoiding obstacles to a designated location in static field is researched. According to the moving feature of the wheeled robots, the time limit of robot passing the vertex of an obstacle was discussed, and turning models and solution algorithms for a single turning and multiple turnings were designed respectively. Through the case simulation, it was found that a optimized path design by increasing the number of turnings turns, which can effectively reduce the time required for a robot to reach a destination, and thus improve the working efficiency of the robot. The research results verify the effectiveness of making short of the time of avoiding obstacles by multiple turnings of robot.