Robotic Path Planning Implementation using Search Algorithms

Abstract-- Till now, many path planning algorithms have been proposed in the literature. The objective of these algorithms is to find the quickest path between initial position to the end position in a certain environment. The complexity of these algorithms depends on the internal parameters such as motor speed or sensor range and on other external parameters, including the accuracy of the map, size of the environment, and the number of obstacles. In this paper, we are giving information about how path planning algorithm finds the optimal path in an uneven terrain with a multiple obstacle using TurtleBot3 robot into the Gazebo environment using Dijkstra's and A*. A fundamental task for any mobile robot is its capability to organize collision-free trajectories from point A to point B, a start to a end position or visiting a series of positions, i.e. When provided a map and a end point, path The focus of this project is path-planning, which involves planning includes selecting the best (collision free, if finding the optimal or near-optimal path from point A to point applicable) trajectory that the robot can follow to reach the goal B. The aim here is to find the shortest path, optimally, that position.