An algorithm for deadlock avoidance in an AGV System

Abstract

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.

Automated guided vehicle systems, state-of-the-art control algorithms and techniques

“…Li et al [86] give a review on the deadlock avoidance in automated manufacturing using Petri nets. Other algorithms use a strategy to detect a cyclic-waiting situation [87], using a graph theory [88], or using a matrix-based deadlock detection algorithm [89].…”

Cooperation of human and machines in assembly lines

“…Automated guided vehicle (AGV) technology has been used for many years, particularly in warehousing and large scale manufacturing [81][82][83][84]. This technology is now ready for a new step forward with the emergence of low cost advanced electronic systems and autonomous navigation systems that will make modern AGVs more cost effective and flexible, and thus also applicable to a much wider range of assembly systems [85][86][87].…”

An impending deadlock-free scheduling method in the case of unified automated material handling systems in 300 mm wafer fabrications

“…Farajzadeh et al (2005) proposed a distributed deadlock detection algorithm on the basis of history-based edge chasing to resolve deadlocks as soon as they were detected, without waiting for the probe to return back. Yoo et al (2005) presented a graphtheoretic-based automated guided vehicle (AGV) deadlock avoidance algorithm that was simple and easily adaptable, and especially suitable in a FMS. Zhang and Judd (2008) demonstrated a deadlock avoidance algorithm for FMS with free choices in part routing which based on the calculation of effective free space of circuits of the digraph model.…”