EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-SA 4.0

A Highly Efficient ACO-SA Algorithm for Robot Path Planning

Wei Li, Feng Yang, Zhibin Li, Juan Mou, Yanmei Ha, Yi Liu, Yanmei Qin, Peiyang Wei, Linlin Chen, Xun Deng, Tinghui Chen, Jia Liu und 5 weitere

EAI Endorsed Transactions on AI and Robotics · 2025

DOI: 10.4108/airo.11177 ↗

Kurz gefasst

Fachartikel in der Zeitschrift EAI Endorsed Transactions on AI and Robotics, 2025. Verfasst von Wei Li und 16 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-SA 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Intelligent algorithms continue to develop, and efficient path planning for mobile robots in complex environments relies heavily on such algorithms. This article proposes an ACO-SA path planning method that combines ant colony and simulated annealing to solve the problems of slow iteration and long computation in classical ant colony algorithms. The training base map is gridded and modeled, and the path is initially calculated and parameterized using traditional ant colony algorithms. The simulated annealing cooling mechanism is introduced to optimize the pheromone strategy, and the robustness of the algorithm is tested using a multi-modal large model random map. Simulation shows that under the map of the training base, the path length of the ACO-SA algorithm remains unchanged, and the convergence speed is improved by 88.9% and 58.3% respectively, while the running time is shortened by 1.5% and 3.5% respectively; In the worst results of the random map, the shortest path is shortened by 36.57% and 35.95% respectively compared to the traditional ant colony algorithm. This algorithm has better optimization effect and path stability, providing a practical solution for intelligent detection robot path planning.

Zitieren

APA

Li, W., Yang, F., Li, Z., Mou, J., Ha, Y., Liu, Y., Qin, Y., Wei, P., Chen, L., Deng, X., Chen, T., Liu, J., Gan, J., Hu, Z., Deng, Y., Li, G., & Su, Q. (2025). A Highly Efficient ACO-SA Algorithm for Robot Path Planning. EAI Endorsed Transactions on AI and Robotics. https://doi.org/10.4108/airo.11177

Vancouver

Li W, Yang F, Li Z, Mou J, Ha Y, Liu Y, et al. A Highly Efficient ACO-SA Algorithm for Robot Path Planning. EAI Endorsed Transactions on AI and Robotics. 2025. doi:10.4108/airo.11177

BibTeX
@article{Li2025,
  author = {Li, Wei and Yang, Feng and Li, Zhibin and Mou, Juan and Ha, Yanmei and Liu, Yi and Qin, Yanmei and Wei, Peiyang and Chen, Linlin and Deng, Xun and Chen, Tinghui and Liu, Jia and Gan, Jianhong and Hu, ZhenZhen and Deng, Yonghong and Li, Guodong and Su, Qifeng},
  title = {A Highly Efficient ACO-SA Algorithm for Robot Path Planning},
  journal = {EAI Endorsed Transactions on AI and Robotics},
  year = {2025},
  doi = {10.4108/airo.11177}
}
Kostenlos starten →