A Full-Coverage Path-Planning Algorithm for a Glass-Curtain-Wall-Cleaning Robot Driven by Ropes

Abstract

Rope-driven robots are increasingly being applied for the efficiently cleaning of glass curtain walls. However, increasingly complex wall surfaces and the various shapes of obstacles may block the robot and reduce coverage. In this study, three-DOF rope-driven cleaning robots and a full-coverage path-planning algorithm were developed to achieve global operation. The robot adopts a five-rope parallel configuration, and four winches are mounted on the wall and one on the ground to produce 3D motion performance. We used a grid method to build the wall model to mark obstacles, and then we decomposed it according to the wall curvature to better access cleaning subareas. To further increase the cleaning coverage rate, a full-coverage path-planning algorithm based on an improved priority heuristic was designed, which does not ignore the inset area of U-shaped obstacles. By introducing two sets of priority criteria to judge the forward direction, the robot can switch directions to cover a whole area when encountering U-shaped obstacles. Furthermore, by planning a return route requiring the least amount of time when entering a dead zone, an escape strategy was developed to prevent the robot from being unable to choose a direction. The experimental results show that the robot, after applying the proposed path-planning algorithm, could complete the global cleaning of complex glass walls with various obstacles.

Keywords

• glass wall cleaning
• rope-driven robot
• wall modeling
• full-coverage path planning