Polynomially Complex Synthesis of Distributed Supervisors for Large-Scale AMSs Using Petri Nets
Document Type
Article
Publication Date
9-1-2016
Abstract
Due to the competition for limited resources by many concurrent processes in large-scale automated manufacturing systems (AMSs), one has to resolve any deadlock issue in order to reach their production goals without disruption and downtime. Monolithic resolution is a conventional approach for optimal or acceptable solutions, but may suffer from computational difficulty. Some decentralized methods are more efficient in finding approximate solutions, but most are application dependent. By modeling AMSs as Petri nets, we develop an innovative distributed approach, which can create a trajectory leading to a desired goal and is adaptable to different kinds of applications. Control strategies are applied to processes locally such that they can proceed concurrently and efficiently. Global goals are always reachable through the local observation, control, and execution of processes without knowing external and extra information. Polynomially complex are designed to find distributed controllers.
Identifier
84951293086 (Scopus)
Publication Title
IEEE Transactions on Control Systems Technology
External Full Text Location
https://doi.org/10.1109/TCST.2015.2504046
ISSN
10636536
First Page
1610
Last Page
1622
Issue
5
Volume
24
Recommended Citation
Hu, Hesuan; Su, Rong; Zhou, Mengchu; and Liu, Yang, "Polynomially Complex Synthesis of Distributed Supervisors for Large-Scale AMSs Using Petri Nets" (2016). Faculty Publications. 10314.
https://digitalcommons.njit.edu/fac_pubs/10314
