On the Shortest and Conflict-Free Path Planning of Multi-AGV System Based on Dijkstra Algorithm and the Dynamic Time-Window Method

摘要：

　　This paper presents a dynamic routing method for shortest path planning and conflict prevention of AGV system,and then illustrates the principle and implementation of this method.It gives a way to schedule a shortest and conflict-free route by utilizing Dijkstra algorithm and the Dynamic Time-Window Method,and comes to the conclusion by experiments that the combination of these algorithms will solve the routing problem of small-sized multi-AGV system to a large extent.

关键词： The Dynamic Time-Window Method Dijkstra Algorithm AGV Path Planning

作者: Tianjian Chen Yuan Sun Wei Dai Wen Tao Shuai Liu

作者单位: School of Mechanical Science and Engineering, Huazhong Univ.of Sci.and Tech., China Department of Control Science and Engineering, Huazhong Univ.of Sci.and Tech., China School of Material Science and Engineering, Huazhong Univ.of Sci.and Tech., China

会议类型: 国际会议

会议名称: 2013 International Conference on Intelligent System,Applied Materials and Control Technology(GSAMCT2013)(2013年智能系统、应用材料和控制技术国际会议)

会议地点: 太原

会议语种:英文

页码: 267-271

在线出版日期: 2013-01-13（万方平台首次上网日期，不代表论文的发表时间）