关键词: 移动机器人, 路径规划, 启发式算法

Abstract:

In order to solve the shortest path of mobile robots in a 3D space from the starting point to the ending point, a new edge point tree heuristic diffusion search（Tree-EP） algorithm is proposed. Firstly, the map space is subjected to density-adjustable 3D discretization. Secondly, the reliable edge point information of the obstacles is screened out according to the safe distance of the obstacles. Thirdly, the potential points are selected to perform a diffusion search for guiding the search direction, according to the tree diffusion architecture. Finally the shortest path is created. A local backtracking adjustment strategy is proposed to locally adjust the path in the search process, resulting in an improved Tree-EP algorithm. In the shortest path search application with complex terrain, the experimental results show that the proposed Tree-EP can find shorter moving paths than other existing algorithms.

Key words: mobile robot, path planning, heuristic algorithm