Polynomial-complexity robust deadlock controllers for a class of automated manufacturing systems with unreliable resources using Petri nets

Document Type

Article

Publication Date

9-1-2020

Abstract

In the context of automated manufacturing systems (AMSs) with unreliable resources, most existing robust deadlock controllers have high computational complexity or relatively low permissiveness. This work focuses on the deadlock control problem of AMSs with a kind of unreliable resources. Petri nets are used to model the dynamic behaviors of such failure-prone AMSs. First a robust deadlock prevention controller is developed for a large class of AMSs under consideration. Such a robust controller guarantees that the system can process all types of parts continuously through any one of their routes, even if one of unreliable resources fails. Also, this robust controller is proved to be optimal, i.e., maximally permissive, during one resource failure period. Then by using the one-step look-ahead method, we establish a polynomial-complexity robust deadlock avoidance policy (DAP) with the same permissiveness as the obtained robust deadlock prevention controller. That is, such a robust DAP not only has low computational complexity, but also is maximally permissive during one resource failure period.

Identifier

85085754336 (Scopus)

Publication Title

Information Sciences

External Full Text Location

https://doi.org/10.1016/j.ins.2020.05.007

ISSN

00200255

First Page

181

Last Page

199

Volume

533

Grant

2018M643660

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS