容器(类型理论)
路径(计算)
运动规划
计算机科学
节点(物理)
数学优化
自动引导车
强化学习
运筹学
工程类
人工智能
计算机网络
机器人
数学
结构工程
机械工程
作者
Hongtao Hu,Xurui Yang,Shichang Xiao,Feiyang Wang
标识
DOI:10.1080/00207543.2021.1998695
摘要
AGV conflict prevention path planning is a key factor to improve transportation cost and operation efficiency of the container terminal. This paper studies the anti-conflict path planning problem of Automated Guided Vehicle (AGV) in the horizontal transportation area of the Automated Container Terminals (ACTs). According to the characteristics of magnetic nail guided AGVs, a node network is constructed. Through the analysis of two conflict situations, namely the opposite conflict situation and same point occupation conflict situation, an integer programming model is established to obtain the shortest path. The Multi-Agent Deep Deterministic Policy Gradient (MADDPG) method is proposed to solve the problem, and the Gumbel-Softmax strategy is applied to discretize the scenario created by the node network. A series of numerical experiments are conducted to verify the effectiveness and the efficiency of the model and the algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI