A Highly Efficient ACO-SA Algorithm for Robot Path Planning

Li, Wei; Yang, Feng; Li, Zhibin; Mou, Juan; Ha, Yanmei; Liu, Yi; Qin, Yanmei; Wei, Peiyang; Chen, Linlin; Deng, Xun; Chen, Tinghui; Liu, Jia; Gan, Jianhong; Hu, ZhenZhen; Deng, Yonghong; Li, Guodong; Su, Qifeng

A Highly Efficient ACO-SA Algorithm for Robot Path Planning

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 (2025) A Highly Efficient ACO-SA Algorithm for Robot Path Planning. EAI Endorsed Transactions on AI and Robotics.

PDF
80132.pdf
Download (3MB)

Abstract

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

Item Type:	Article
Date Deposited:	04 Mar 2026 20:26
Last Modified:	16 Apr 2026 15:31
URI:	http://eprints.eai.eu/id/eprint/60701

Actions (login required)

: View Item