RRT based path planning for mobile robots on a 3D surface mesh

Abstract

Path planning is one of the fundamental problems in robotics. Due to the advancement in technology, the application of mobile robots has increased in recent years, not only in the field of robotics, but also in other domains such as computational biology, computer animation and aerospace. Path planning in high dimensional environments for mobile robots is known to be computationally challenging, but since the introduction of the sampling-based planning algorithms such as rapidly exploring random tree (RRT) and probabilistic roadmap (PRM), solving high dimensional path planning problems has became easier. In this paper, we present a mesh-based RRT path planning approach. Connecting RRT tree nodes on a nonplanar surface mesh requires the computation of geodesics, shortest length paths on the mesh, which can create a high computational load. The proposed method reduces the number and length of geodesics on the mesh. Simulation results show that this method finds a feasible path faster than the basic RRT on the mesh.