货架下方可通行无人仓中多AGV系统的路径规划
DOI:
作者:
作者单位:

1.天津大学;2.北京极智嘉科技股份有限公司

作者简介:

通讯作者:

中图分类号:

TP242.6

基金项目:

国家自然科学基金项目(面上项目,重点项目,重大项目)


Path planning of a multiple AGV system in unmanned warehouse with bottom passable shelves
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献()
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    本文提出了一种改进A*算法来解决在货架下方可通行的无人仓中多AGV(自动导引车)系统的路径规划问题.。多AGV系统进行搬运作业时容易发生冲突、碰撞和死锁。为此,引入多值栅格和交通规则改进A*算法解决该场景下多AGV系统的轨迹规划问题。为提升系统搬运效率,通过增加货架召回机制、转弯代价和热度代价对规划路径进行优化,并采用二叉堆数据结构提高路径规划速度。最后,利用Python搭建了可视化的四方向栅格无人仓模型,对本文提出的改进A*算法和轨迹优化策略进行仿真验证。

    Abstract:

    In this paper, an improved A* algorithm is proposed to solve a path planning problem on a multiple AGVs (automatic guided vehicles) system in unmanned warehouse with bottom passable shelves. The multiple AGV system is prone to conflict, collision and deadlock in the process of carrying. Therefore, the A* algorithm is improved by introducing multi-valued grid and traffic rules to solve the path planning problem for the multiple AGV system. To improve handling efficiency of the multiple AGV system, the planned path is optimized by adding shelf recall mechanism, turning cost and heat cost. A binary heap data structure is also used to improve calculation speed of the path planning. Finally, the improved A* algorithm and the path optimization strategy are simulated and verified by a visual quadrilateral grid unmanned warehouse model built by Python.

    参考文献
    相似文献
    引证文献
引用本文
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2023-03-31
  • 最后修改日期:2024-06-27
  • 录用日期:2023-07-21
  • 在线发布日期: 2024-06-05
  • 出版日期:
文章二维码