|Robotic Path Planning Based on a Triangular Mesh Map
Yanbin Liu and Yuanyuan Jiang*
International Journal of Control, Automation, and Systems, vol. 18, no. 10, pp.2658-2666, 2020
Abstract : Aiming at the problem of robot path planning in complex maps, an algorithm of robot path planning based on a triangular grid graph is proposed. Firstly, a weighted undirected loop graph and a feasible domain of nodes are obtained by discretizing the triangular mesh map. Next, the Dijkstra search algorithm is applied to find the feasible shortest path from an initial to a final configuration. Finally, The Douglas-Peucker algorithm is applied to remove duplicate and redundant nodes in the feasible path, and the waypoint is extracted. The final path is a curve that is obtained by connecting the several extracted waypoint. The proposed algorithm is tested for various maps. Compared with the probabilistic roadmap method, the experimental results show that the proposed method can overcome the shortcomings of the random sampling method. Furthermore, the experimental result of triangular mesh map method used in two labyrinth maps show that the triangular mesh map method can solve the robot path planning problem in complex map very well, and it is an excellent algorithm for robot path planning.
PRM method, robotic path planning, triangular mesh map, waypoint
Download PDF : Click this link