An algorithm for deadlock avoidance in an AGV System

摘要

In this paper, a simple and easily adaptable deadlock avoidance algorithm for an automated guided vehicle (AGV) system is presented. This algorithm uses the graph-theoretic approach. Unlike Petri-net-based methods, which are complex and static, it is easy to modify the existing model as the configuration of the system changes. Therefore, it is suitable for the AGV system in a flexible manufacturing system (FMS) and a retail or postal distribution center. Moreover, because it is very simple, it is appropriate for real-time control mechanisms. This paper consists of two parts: the first part presents an AGV deadlock avoidance algorithm that uses the graph-theoretic approach, and the second suggests appropriate routing strategies based on the proposed algorithm. The results show that this deadlock avoidance algorithm can be modified easily whenever the configuration of an FMS changes and provide high-performance on the deadlock avoidance. Finally, experimental results that confirm the validity of this approach are provided.