Automatic Recharging Path Planning for Cleaning Robots

Authors:
Open Access
Publisher website
Google Scholar
Abstract
To solve the problem of automatic recharging path planning for cleaning robots in complex industrial environments, this paper proposes two environmental path planning types based on designated charging location and multiple charging locations. First, we use the improved Maklink graph to plan the complex environment; then, we use the Dijkstra algorithm to plan the global path to reduce the complex two-dimensional path planning to one dimension; finally, we use the improved fruit fly optimization algorithm (IFOA) to adjust the path nodes for shorting the path length. Simulation experiments show that the effectiveness of using this path planning method in a complex industrial environment enables the cleaning robot to select a designated location or the nearest charging location to recharge when the power is limited. The proposed improved algorithm has the characteristics of a small amount of calculation, high precision, and fast convergence speed.
Funding Information
  • Heilongjiang Provincial University (135509114, LH2019F038)
  • Natural Science Foundation of Heilongjiang Province (135509114, LH2019F038)

This publication has 35 references indexed in Scilit: