Efficient Path Planning Algorithm Based on Laser SLAM and an Optimized Visibility Graph for Robots

Abstract

Mobile robots’ efficient path planning has long been a challenging task due to the complexity and dynamism of environments. If an occupancy grid map is used in path planning, the number of grids is determined by grid resolution and the size of the actual environment. Excessively high resolution increases the number of traversed grid nodes and thus prolongs path planning time. To address this challenge, this paper proposes an efficient path planning algorithm based on laser SLAM and an optimized visibility graph for mobile robots, which achieves faster computation of the shortest path using the optimized visibility graph. Firstly, the laser SLAM algorithm is used to acquire the undistorted LiDAR point cloud data, which are converted into a visibility graph. Secondly, a bidirectional A* path search algorithm is combined with the Minimal Construct algorithm, enabling the robot to only compute heuristic paths to the target node during path planning in order to reduce search time. Thirdly, a filtering method based on edge length and the number of vertices of obstacles is proposed to reduce redundant vertices and edges in the visibility graph. Additionally, the bidirectional A* search method is implemented for pathfinding in the efficient path planning algorithm proposed in this paper to reduce unnecessary space searches. Finally, simulation and field tests are conducted to validate the algorithm and compare its performance with classic algorithms. The test results indicate that the method proposed in this paper exhibits superior performance in terms of path search time, navigation time, and distance compared to D* Lite, FAR, and FPS algorithms.