Throughout recent decades, one of the most important and challenging problems in robotics has been robot's path planning. Path planning means a robot must find its way from start to the goal point and track it without any collision to the obstacles. For this aim during the recent decades a wide variety of algorithms such as A*, Dijkstra and … have been proposed that some of which generate an optimal path as their output while others tend to create only a path regardless of its optimality. One of the most practical path planning methods is RRT algorithm which is executable in real-world applications, and by generating some nodes randomly then creating a tree-based graph, thereby outputting a...