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(star).

翻译：迄今为止，文献中已提出多种路径规划算法。这些算法的目标是在特定环境中寻找从起始位置到目标位置的最快路径。算法的复杂度取决于内部参数（如电机速度或传感器范围）以及其他外部参数（包括地图精度、环境尺寸和障碍物数量）。本文通过TurtleBot3机器人在Gazebo环境中，利用Dijkstra和A*算法，阐述了路径规划算法如何在具有多重障碍物的非平坦地形中寻找最优路径。