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

Abstract

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.