Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 898-903 |
Number of pages | 6 |
Journal | Procedia Computer Science |
Volume | 220 |
DOIs | |
Publication status | Published - 2023 |
Event | 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, Belgium Duration: 15 Mar 2023 → 17 Mar 2023 |
Keywords
- Agriculture
- Mobile robot
- Path planning
ASJC Scopus subject areas
- General Computer Science