关键词: 路径规划, 特征地图, 爬虫算法, 动态窗口法, 融合算法

Abstract: In order to utilize the advantage of the feature map in calculating efficiency and solve the problem that the traditional dynamic window approach is sensitive to global parameters, a path planning fusion algorithm based on feature map is proposed. A feature map expression applicable to path planning is given, and the detection of obstacles in the feature map is achieved by improving the calculation method of the distance between the robot and the obstacles. Combined with the basic principle of the Bug algorithm and the properties of line segment features, the searching and optimization algorithm is used to search the global feasible path first, and then the key nodes of the global optimal path are obtained by node optimization, and solutions are proposed for the problems of search direction selection at internal and external corner points and obstacle endpoint bypassing. To address the problem of high sensitivity of the traditional dynamic window approach to global parameters, the degree of influence of the parameters in the objective function on the planned path when the robot is at different positions is analyzed, and the original objective function is improved using the dynamic parameter approach. When the algorithms are fused, the calculation method of direction function in the objective function is improved in order to solve the problem that the robot may slow down in the intermediate nodes of the path. The simulation experiment verifies that the searching optimization algorithm is effective, the improved dynamic window approach reduces the sensitivity of parameters, and the fusion algorithm has a greater advantage in computational efficiency, with a maximum reduction of 79.27% and a minimum reduction of 43.16% in computational time consumption, and the robot moves more smoothly.

Key words: path planning, feature map, Bug algorithm, dynamic window approach, fusion algorithm