Holonomic Mobile Robot Planners: Performance Analysis

Many algorithms have been proposed to tackle the path planning problem in mobile robots. Among the well-known and established algorithms are the Probabilistic Road Map (PRM) algorithm, A* algorithm, Genetic algorithm (GA), Rapidly-exploring random tree (RRT), and dual Rapidly-exploring random trees (RRT-connect). Hence, this paper will focus on the performance comparison between the aforementioned algorithms concerning computation time, path length, and fail and success rate for producing a path. For the sake of fair and conclusive results, simulation is conducted in two phases with four different environments, namely, free space environment, low cluttered environment, medium cluttered environment, and high cluttered environment. The results show that RRT-connect has a high success rate in producing a feasible path with the least computation time. Hence, RRTs-based sampling algorithms, in general, and RRT-connect, in specific, will be explored in-depth for possible optimization.