Path planning algorithm for sweeping robot full traversal cleaning area

摘要

Path planning is an important part of the research and development of sweeping robots, and algorithm research is the core content of path planning. This paper proposes a path planning algorithm for sweeping robot sweeping areas in complex environments, which can be applied to both static and dynamic environments. Simulation experiments show that the algorithm proposed in this paper can cover 100% of the cleaning area, and the path repetition rate is about 5%; the cleaning efficiency is significantly better than other reference algorithms. The full traversal path planning algorithm proposed in this paper can provide new ideas for the development of sweeping robots and promote the construction of smart home services.