This article presents some of the current contributions to the robotic path planning field. Reliable collision free path is the fundamental thing for proper working of autonomous vehicle/robots. In order to find an optimal path for robot, environment or workspace need to be understood correctly and suitable algorithm need to used. Many researchers developed different algorithm techniques as per the required operations. This paper presents an overview of strength and weakness of A* algorithm for static environment using distance formula. A* algorithm works on the lower details of the map hence, it is considered as a higher-level path planning technique. A* algorithm is based on the availability of adjacent nodes and distance of goal location from the current state of the robot.

No abstract