Author(s)

Cheng Hongping, Shao Zhiwei

Corresponding Author

Cheng Hongping

ABSTRACT

Based on the problem of how to avoid obstacles and make the shortest path planning when the sweeping robot encounters obstacles in the cleaning process, this paper designs an algorithm for the path length of a single obstacle, calculates it separately by using MATLAB software, and finally obtains the shortest path for the sweeping robot to avoid obstacles from the starting point of sweeping area to the target end point by comprehensive comparison.

KEYWORDS

Sweep the floor, Robot, Obstacles, Shortest path