To solve the problem that sampling-based Rapidly-exploring Random Tree (RRT) method is difficult to guarantee optimality. This paper proposed the Post Triangular Processing of Midpoint Interpolation method minimized the planning time and shorter path length of the sampling-based algorithm. The proposed Post Triangular Processing of Midpoint Interpolation method makes a closer to the optimal path and somewhat solves the sharp path problem through the interpolation process. The experiments were conducted to verify the performance of the proposed method. Applying the method proposed in this paper to the RRT algorithm increases the efficiency of optimization compared to the planning time.

This paper proposed a triangular inequality-based rewiring method for the Rapidly exploring Random Tree (RRT)-Connect robot path-planning algorithm that guarantees the planning time compared to the RRT algorithm, to bring it closer to the optimum. To check the proposed algorithm’s performance, this paper compared the RRT and RRT-Connect algorithms in various environments through simulation. From these experimental results, the proposed algorithm shows both quicker planning time and shorter path length than the RRT algorithm and shorter path length than the RRT-Connect algorithm with a similar number of samples and planning time.