Name
Title | ||
|---|---|---|
Polynomial-Complexity Supervisory Control For Flexible Assembly Systems Based On Petri Nets |
Abstract | ||
|---|---|---|
Flexible assembly systems (FASs) are a class of resource allocation systems with assembly processes as their inevitable components. Deadlock resolution and liveness enforcement play important roles in the supervisory control of FASs. Design of deadlock avoidance policies (DAPs) for FASs has received significant attention recently. The computational feasibility of real-time DAPs is of great importance for the policies' online implementation in practical applications. However, there are difficulties brought by the existence of assembly processes. So far, nearly all known DAPs with polynomial-time complexity apply only to systems without assembly operations. This study focuses on the deadlock-avoidance control problem of a broader class of FASs as compared to those discussed in the existing work. Specifically, for an FAS addressed in this paper, each resource can be shared by any two operations, and it also allows multiple resource acquisition at each processing step. This work develops a novel DAP for such FASs, which is based on their Petri-net models and actually an improved Banker's algorithm that consists of three executable algorithms. Moreover, the computational time complexity of the DAP is polynomial in the size of the system model. The application of the proposed method to some examples illustrates its effectiveness and efficiency. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1080/0951192X.2017.1335436 | INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING |
Keywords | Field | DocType |
Deadlock avoidance, discrete event systems, flexible assembly system (FAS), Petri nets | Petri net,Assembly systems,Resource Acquisition Is Initialization,Computer science,Supervisory control,Deadlock,Enforcement,Polynomial complexity,Distributed computing,Liveness | Journal |
Volume | Issue | ISSN |
31 | 1 | 0951-192X |
Citations | PageRank | References |
0 | 0.34 | 43 |
Authors | ||
5 | ||