| 注册
首页|期刊导航|工业工程|基于改进DQN算法的无人仓多AGV路径规划

基于改进DQN算法的无人仓多AGV路径规划

谢勇 郑绥君 程念胜 朱洪君

工业工程2024,Vol.27Issue(1):36-44,53,10.
工业工程2024,Vol.27Issue(1):36-44,53,10.DOI:10.3969/j.issn.1007-7375.220247

基于改进DQN算法的无人仓多AGV路径规划

Multi-AGV Route Planning for Unmanned Warehouses Based on Improved DQN Algorithm

谢勇 1郑绥君 1程念胜 2朱洪君1

作者信息

  • 1. 华中科技大学 人工智能与自动化学院,湖北 武汉 430074
  • 2. 航天信息股份有限公司,北京 100195
  • 折叠

摘要

Abstract

To solve the problem of multi-AGV route planning and conflicts in unmanned warehouses,with the objective of minimizing the total travel time,a multi-AGV route planning model is established,and an improved DQN algorithm based on dynamic decision-making is proposed.An empirical knowledge model based on static route planning of a single AGV is designed to guide the learning and exploration direction of AGVs.It avoids conflicts and obstacles for AGVs in advance,and accelerates the convergence of the proposed algorithm.Also,a conflict resolution strategy based on the shortest total travel time is proposed to fundamentally solve the problem of multi-AGV route conflicts and deadlocks.Finally,a grid map of an unmanned warehouse is established for simulation experiments.Results show that,compared with other DQN algorithms,the convergence speed of the proposed model and algorithm is increased by 13.3%,and the average loss value is reduced by 26.3%.This result indicates that the model and algorithm are conducive to avoiding and resolving the conflicts of multi-AGV route planning in unmanned warehouses,reducing the total travel time of multiple AGVs and having important guiding significance to improve the efficiency of unmanned warehouse operations.

关键词

多AGV/路径规划/DQN算法/经验知识/冲突消解

Key words

multiple AGVs/route planning/DQN algorithm/empirical knowledge/conflict resolution

分类

管理科学

引用本文复制引用

谢勇,郑绥君,程念胜,朱洪君..基于改进DQN算法的无人仓多AGV路径规划[J].工业工程,2024,27(1):36-44,53,10.

基金项目

国家自然科学基金资助面上项目(71771096) (71771096)

国家自然科学基金创新群体资助项目(71821001) (71821001)

工业工程

OACHSSCDCSTPCD

1007-7375

访问量0
|
下载量0
段落导航相关论文