节点文献

基于改进蚁群算法的物流仓库机器人路径规划与避障

Path Planning and Obstacle Avoidance for Logistics Warehouse Robots Based on Improved Ant Colony Algorithm

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 刘为国陈雨瑶

【Author】 LIU Weiguo;CHEN Yuyao;School of Electrical and Information Engineering, Anhui University of Science and Technology;

【机构】 安徽理工大学电气与信息工程学院

【摘要】 为有效提升仓库机器人搬运货物的效率,采用改进的蚁群算法规划仓库机器人搬运货物的路径。首先引入动态信息素更新机制,加入势场启发函数,引入精英蚂蚁,进而将改进蚁群算法与动态窗口避障融合。仿真结果表明:与传统蚁群算法相比,改进蚁群算法规划出的路径长度更短且拐点数量更少;在寻路方面效率更高,并且有着更精准的收敛性与鲁棒性。

【Abstract】 To effectively enhance the efficiency of warehouse robots in cargo handling, researchers have employed an improved ant colony algorithm to plan the cargo handling paths for warehouse robots. This study innovatively introduces a dynamic pheromone update mechanism, incorporates a potential field heuristic function, and introduces elite ants to enhance search capabilities. Then, the improved ant colony algorithm is integrated with the dynamic window obstacle avoidance. The simulation results show that compared with the traditional ant colony algorithm, the improved ant colony algorithm plans a shorter path with fewer turning points, has higher efficiency in pathfinding, and has more accurate convergence and robustness.

【关键词】 蚁群算法机器人路径规划动态窗口
【Key words】 ant colony algorithmrobotpath planningdynamic window
【基金】 国家自然科学基金(62003001)
  • 【文献出处】 兰州工业学院学报 ,Journal of Lanzhou Institute of Technology , 编辑部邮箱 ,2026年01期
  • 【分类号】TP242;TP18
  • 【下载频次】159
节点文献中: 

本文链接的文献网络图示:

本文的引文网络