Development of autonomous vehicle navigation in unstructured environments: the impact of implementing a path planning algorithm on autonomous vehicles
Uloženo v:
| Název: | Development of autonomous vehicle navigation in unstructured environments: the impact of implementing a path planning algorithm on autonomous vehicles |
|---|---|
| Autoři: | Desi Windi Sari, Suci Dwijayanti, Bhakti Yudho Suprapto |
| Zdroj: | Eastern-European Journal of Enterprise Technologies; Vol. 2 No. 3 (134) (2025): Control processes; 16-24 Eastern-European Journal of Enterprise Technologies; Том 2 № 3 (134) (2025): Процеси управління; 16-24 |
| Informace o vydavateli: | Private Company Technology Center, 2025. |
| Rok vydání: | 2025 |
| Témata: | планування шляху, ant colony optimization, А, A, оптимізація мурашиної колонії, автономні транспортні засоби, autonomous vehicles, artificial potential fields, path planning, штучні потенційні поля |
| Popis: | The path planning system has been identified as an efficient method for optimizing navigation, reducing energy consumption, and ensuring safety in autonomous vehicles. Various studies have been conducted on algorithms such as Ant Colony Optimization (ACO), Artificial Potential Field (APF), and the A* algorithm. However, only a few studies have evaluated the effectiveness of each of these algorithms, especially for autonomous vehicles implemented in real-road scenarios. Thus, this study aims to assess the effectiveness of ACO, APF, and A* in identifying the optimal path, computational efficiency, and execution time for generating routes in an autonomous vehicle. Experiments were conducted using road coordinate data from the Universitas Sriwijaya campus, representing suburban road conditions in Indonesia. The results showed that the A* algorithm excels in finding optimal routes, with an average path length of 0.48 km and a 100 % success rate. This is due to its heuristic, Euclidean-based approach. Meanwhile, ACO achieved an average path length of 0.57 km with a 100 % success rate, whereas APF achieved 0.36 km with a 41 % success rate. ACO demonstrated varied route performance due to its probabilistic nature, while APF generated paths more quickly but often failed in complex environments due to local minimum traps. Regarding computation time, an increase in distance leads to a longer route formation time for APF and A*, respectively. However, in ACO, route distance does not directly determine the time required for route formation, as the algorithm incorporates a probability factor in the process. This study confirms that A* is more optimal for global path planning, whereas APF is better suited for local path planning. These findings provide valuable insights into the development of autonomous vehicle navigation in unstructured environments |
| Druh dokumentu: | Article |
| Popis souboru: | application/pdf |
| ISSN: | 1729-4061 1729-3774 |
| DOI: | 10.15587/1729-4061.2025.323746 |
| Přístupová URL adresa: | https://journals.uran.ua/eejet/article/view/323746 |
| Rights: | CC BY |
| Přístupové číslo: | edsair.doi.dedup.....b7fb85d6bcd393ca5fda3348eae8ffcc |
| Databáze: | OpenAIRE |
Nájsť tento článok vo Web of Science | Abstrakt: | The path planning system has been identified as an efficient method for optimizing navigation, reducing energy consumption, and ensuring safety in autonomous vehicles. Various studies have been conducted on algorithms such as Ant Colony Optimization (ACO), Artificial Potential Field (APF), and the A* algorithm. However, only a few studies have evaluated the effectiveness of each of these algorithms, especially for autonomous vehicles implemented in real-road scenarios. Thus, this study aims to assess the effectiveness of ACO, APF, and A* in identifying the optimal path, computational efficiency, and execution time for generating routes in an autonomous vehicle. Experiments were conducted using road coordinate data from the Universitas Sriwijaya campus, representing suburban road conditions in Indonesia. The results showed that the A* algorithm excels in finding optimal routes, with an average path length of 0.48 km and a 100 % success rate. This is due to its heuristic, Euclidean-based approach. Meanwhile, ACO achieved an average path length of 0.57 km with a 100 % success rate, whereas APF achieved 0.36 km with a 41 % success rate. ACO demonstrated varied route performance due to its probabilistic nature, while APF generated paths more quickly but often failed in complex environments due to local minimum traps. Regarding computation time, an increase in distance leads to a longer route formation time for APF and A*, respectively. However, in ACO, route distance does not directly determine the time required for route formation, as the algorithm incorporates a probability factor in the process. This study confirms that A* is more optimal for global path planning, whereas APF is better suited for local path planning. These findings provide valuable insights into the development of autonomous vehicle navigation in unstructured environments |
|---|---|
| ISSN: | 17294061 17293774 |
| DOI: | 10.15587/1729-4061.2025.323746 |