Vasconez, Juan P.Basoalto, FernandoBriceno, Inesmar C.Pantoja, Jenny M.Larenas, Roberto A.Rios, Jhon H.Castro, Felipe A.2024-04-302024-04-302023-03Procedia Computer Science. Volume 220, Pages 898 - 903. 2023. 14th International Conference on Ambient Systems, Networks and Technologies Networks, ANT 2023 and The 6th International Conference on Emerging Data and Industry 4.0, EDI40 2023.Leuven. 15 March 2023through 17 March 2023. Code 1897121877-0509https://repositorio.unab.cl/handle/ria/56509Indexación: ScopusPath 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. © 2023 Elsevier B.V.. All rights reserved.enAgricultureMobile robotPath planningArtículoCC BY-NC-ND 4.0 DEED Attribution-NonCommercial-NoDerivs 4.0 International10.1016/j.procs.2023.03.122