Hybrid RRT-A*: An Improved Path Planning Method for an Autonomous Mobile Robots

Abstract

Although the Basic RRT algorithm is considered a traditional search method, it has been widely used in the field of robot path planning (manipulator and mobile robot), especially in the past decade. This algorithm has many features that give it superiority over other methods. On the other hand, the Basic RRT suffers from a bad convergence rate (it takes a long time until finding the goal point), especially in environments with cluttered obstacles, or whose targets are located in narrow passages. Many studies have discussed this problem in recent years. This paper introduces an improved method called (Hybrid RRT-A*) to overcome the shortcomings of the original RRT, specifically slow convergence and cost rate. The heuristic function of A-star algorithm is combined with RRT to decrease tree expansion and guide it towards the goal with less nodes and time. Various experiments have been conducted with different environment scenarios to compare the proposed method with the Basic RRT and A-star under the same conditions, which have shown remarkable performance. The time consumed to find the path of the worst one of these scenarios is about 4.9 seconds, whereas it is 18.3 and 34 for A-star and RRT, respectively.

A review: On bio-inspired optimization methods for path planning of mobile robot

“…The Road Map technique [18], Cell Decomposition technique [19], the Rapidly Exploring Random Tree technique is One of the more popular traditional samplingbased path planning algorithms. However, beyond the computation cost, it also has some issues with the convergence rate [20][21][22][23], and the potential field technique [24]are examples of classical methodologies. Dijkstra's algorithm [25], and A* search algorithm are examples of heuristic approaches.…”

Grasshopper optimization algorithm based path planning for autonomous mobile robot

“…Some of these problems are increasingly complex, which becomes difficult to solve and optimize using conventional mathematical methods. Path planning is one of the NP-Hard problems, which requires a high computational cost to be solved using classical methods [1]- [3]. Metaheuristic methods have been proposed to overcome the complexity of classical methods.…”