Please wait a minute...
Chinese Journal of Engineering Design  2005, Vol. 12 Issue (6): 359-362    DOI:
    
Research on designing of transportation capability in AGVS
 SUN  Liang, SUN  Jian-Zhen
School of Mechanical Engineering, Shandong Instiute of Light Industry, Jinan 250100, China
Download: HTML     PDF(157KB)
Export: BibTeX | EndNote (RIS)      

Abstract  To solve design problem of transportation capacity, caused by two or more AGVs in AGVS competing the same resource, a time window technology based on greedy algorithm is presented. Simulation experiments indicate that this method can completely solve this problem and meantime maximize the transportation capacity of this system.

Key wordsAGVS      time window      greedy algorithm      conflict-free problem      design of transportation capability     
Published: 28 December 2005
Cite this article:

SUN Liang, SUN Jian-Zhen. Research on designing of transportation capability in AGVS. Chinese Journal of Engineering Design, 2005, 12(6): 359-362.

URL:

https://www.zjujournals.com/gcsjxb/     OR     https://www.zjujournals.com/gcsjxb/Y2005/V12/I6/359


自动导引小车系统运输能力的设计研究

为了解决自动导引小车系统(AGVS)中由于两辆以上自动导引小车竞争同一资源(通道或缓冲区)所引起的碰撞导致的运输能力设计问题,提出了一种基于贪心算法的时间窗技术方法。仿真实验表明,该方法完全可以解决这一问题,同时可以使系统的运输能力最大化。

关键词: AGVS,  时间窗,  贪心算法,  避碰问题,  运输能力设计 
[1] LIANG Cheng-ji, SHEN Shan-shan, HU Wen-hui. AGV path planning considering alternative paths based on time window of road section[J]. Chinese Journal of Engineering Design, 2018, 25(2): 200-208.
[2] ZHU Long-biao, WANG Hui, WANG Jing-liang, SHAO Xiao-jiang, ZHU Zhi-hui. Research on path planning of parking system based on dynamic time window[J]. Chinese Journal of Engineering Design, 2017, 24(4): 440-448.