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.
Idioma original | Inglés |
---|---|
Páginas (desde-hasta) | 898-903 |
Número de páginas | 6 |
Publicación | Procedia Computer Science |
Volumen | 220 |
DOI | |
Estado | Publicada - 2023 |
Evento | 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, Bélgica Duración: 15 mar. 2023 → 17 mar. 2023 |
Áreas temáticas de ASJC Scopus
- Ciencia de la Computación General