Research on wireless robot path planning under edge computing considering multistep searching and inflection points

摘要

Abstract The wireless robot path planning is a hot research topic in the fields of automatic control and wireless communication. With the help of the edge computing model, the robot can implement location‐aware and positioning to effectively explore the direction and avoid barriers with less computation time. In this paper, an improved ant colony optimization algorithm is proposed to wireless robot path planning. First, the grid method to build a formal map for the robot environment is introduced, by which we can accurately simulate the barriers and paths environment. Second, the multistep path‐planning method is proposed to optimize the path length of robot walking and improve the quality of the solution. Third, to make the wireless robot route smoother, the inflection point parameter is integrated into the probability formula. All these related data are collected and processed at the edge node with cooperative communication. The way of edge computing makes root robustness and stability. Besides, the pheromone strength coefficient Q is reduced to increase the convergence speed of the proposed algorithm. Finally, the experiment results show that our method can obtain a better path planning for the wireless robot, compared with the traditional algorithms.