This paper focuses on real-time control of automated storage and retrieval systems (AS/RSs) serviced by a rail-guided ve-hicle system, a widely used solution for material handling in ware-houses. The generic multiproduct AS/RS is modeled as a timed dis-crete event dynamical system, whose state provides the information on the current interactions between users and resources. More-over, we address the real-time controller that governs resource allocations and scheduling choices by enabling and inhibiting the system events in order to avoid collisions and deadlocks. To this aim, we characterize deadlock in AS/RSs and define two dead-lock resolution strategies: a deadlock avoidance and a deadlock detection/recovery policy. The proposed deadlock formulation and characterization have a general validity and can be applied to sin-gle unit resource allocation systems where a subset of users may be regarded as resources of other users. We compare the proposed control policies for a large-scale AS/RS presented in the related literature by several discrete event simulation tests
Deadlock Detection and Avoidance Strategies for Automated Storage and Retrieval Systems / Dotoli, Mariagrazia; Fanti, Maria Pia. - In: IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS. PART C, APPLICATIONS AND REVIEWS. - ISSN 1094-6977. - 37:4(2007), pp. 541-552. [10.1109/TSMCC.2007.897690]
Deadlock Detection and Avoidance Strategies for Automated Storage and Retrieval Systems
DOTOLI, Mariagrazia;FANTI, Maria Pia
2007-01-01
Abstract
This paper focuses on real-time control of automated storage and retrieval systems (AS/RSs) serviced by a rail-guided ve-hicle system, a widely used solution for material handling in ware-houses. The generic multiproduct AS/RS is modeled as a timed dis-crete event dynamical system, whose state provides the information on the current interactions between users and resources. More-over, we address the real-time controller that governs resource allocations and scheduling choices by enabling and inhibiting the system events in order to avoid collisions and deadlocks. To this aim, we characterize deadlock in AS/RSs and define two dead-lock resolution strategies: a deadlock avoidance and a deadlock detection/recovery policy. The proposed deadlock formulation and characterization have a general validity and can be applied to sin-gle unit resource allocation systems where a subset of users may be regarded as resources of other users. We compare the proposed control policies for a large-scale AS/RS presented in the related literature by several discrete event simulation testsI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.