five

Improved Ant Colony Algorithm⁃Based Concrete Robot Path Planning

收藏
中国科学数据2026-03-11 更新2026-04-25 收录
下载链接:
https://www.sciengine.com/AA/doi/10.12422/j.issn.1672-6952.2026.01.010
下载链接
链接失效反馈
官方服务:
资源简介:
To address the challenges of slow convergence, susceptibility to local optima and path redundancy in the path planning of concrete pouring robots in complex construction environments, an improved ant colony algorithm⁃based path planning optimization method for concrete robots is proposed. First, a new pheromone update mechanism is formulated and the hindsight experience replay (HER) algorithm is applied to define pseudo⁃target points, thereby addressing the slow convergence and local optimum entrapment issues of conventional ant colony algorithm (ACO). Second, a new obstacle heuristic factor is designed to improve the obstacle avoidance ability of the traditional ant colony algorithm.Third, to solve the limitation of path redundancy in the traditional ant colony algorithm, a curve smoothing function is introduced to eliminate redundant nodes and improve the path quality. Simulation experiments show that the algorithm proposed in this paper has good effectiveness and stability in terms of the shortest path length, the number of turning points and iteration efficiency.
创建时间:
2026-03-11
5,000+
优质数据集
54 个
任务类型
进入经典数据集
二维码
社区交流群

面向社区/商业的数据集话题

二维码
科研交流群

面向高校/科研机构的开源数据集话题

数据驱动未来

携手共赢发展

商业合作