Vásconez, J.Basoalto, F.Briceño, I.Pantoja, J.Larenas, R.Rios, J.Castro, F.2024-09-062024-09-062023Procedia Computer Science, Volume 220, 2023, Pages 898-9031877-0509https://repositorio.unab.cl/handle/ria/59931Path planning is a research topic that is still being studied for the area of mobile robotics. However, path-planning algorithms for mobile robot applications depend strongly on the environment and its complexity. In this work, we implemented three different path-planning algorithms for a simulated agricultural process. The selected algorithms are Breadth First search (BFS), Depth first search (DFS), and A*. We compare and evaluate such algorithms by using different accuracy metrics. The results demonstrate that the A* path planning method outperforms the other methods considering processing time, travel time, distance, and battery consumption.enPath planningMobile robotAgricultureArtículoAttribution-NonCommercial-NoDerivatives 4.0 Internationalhttps://doi.org/10.1016/j.procs.2023.03.122