Abstract
Path planning is an essential part of robot intelligence. In this paper, we summarize the characteristics of path planning of industrial robots. And owing to the probabilistic completeness, we review the rapidly-exploring random tree (RRT) algorithm which is widely used in the path planning of industrial robots. Aiming at the shortcomings of the RRT algorithm, this paper investigates the RRT algorithm for path planning of industrial robots in order to improve its intelligence. Finally, the future development direction of the RRT algorithm for path planning of industrial robots is proposed. The study results have particularly guided significance for the development of the path planning of industrial robots and the applicability and practicability of the RRT algorithm.