Comparison of path planning methods for robot navigation in simulated agricultural environments
No hay miniatura disponible
Fecha
2023
Profesor/a Guía
Facultad/escuela
Idioma
en
Título de la revista
ISSN de la revista
Título del volumen
Editor
Elsevier
Nombre de Curso
Licencia CC
Attribution-NonCommercial-NoDerivatives 4.0 International
Licencia CC
Resumen
Path 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.
Notas
Palabras clave
Path planning, Mobile robot, Agriculture
Citación
Procedia Computer Science, Volume 220, 2023, Pages 898-903
DOI
https://doi.org/10.1016/j.procs.2023.03.122