Dijkstra算法
自动引导车
钥匙(锁)
任务(项目管理)
计算机科学
院子
控制(管理)
容器(类型理论)
路径(计算)
实时计算
工程类
运输工程
模拟
汽车工程
运筹学
最短路径问题
计算机网络
人工智能
量子力学
系统工程
计算机安全
图形
物理
理论计算机科学
机械工程
作者
Meisu Zhong,Yongsheng Yang,Shu Sun,Yamin Zhou,Octavian Postolache,Ying-En Ge
标识
DOI:10.1177/0142331220940110
摘要
With the continuous increase in labour costs and the demands of the supply chain, improving the efficiency of automated container terminals has been a key factor in the development of ports. Automated guided vehicles (AGVs) are the main means of horizontal transport in such terminals, and problems in relation to their use such as vehicle conflict, congestion and waiting times have become very serious, greatly reducing the operating efficiency of the terminals. In this article, we model the minimum driving distance of AGVs that transport containers between quay cranes (QCs) and yard cranes (YCs). AGVs are able to choose the optimal path from pre-planned paths by testing the overlap rate and the conflict time. To achieve conflict-free AGV path planning, a priority-based speed control strategy is used in conjunction with the Dijkstra depth-first search algorithm to solve the model. The simulation experiments show that this model can effectively reduce the probability of AGVs coming into conflict, reduce the time QCs and YCs have to wait for their next task and improve the operational efficiency of AGV horizontal transportation in automated container terminals.
科研通智能强力驱动
Strongly Powered by AbleSci AI