Polynomially Complex Synthesis of Distributed Supervisors for Large-Scale AMSs Using Petri Nets

Hesuan Hu, Rong Su, Mengchu Zhou, Yang Liu

Research output: Contribution to journalArticlepeer-review

34 Scopus citations

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.

Original languageEnglish (US)
Article number7360905
Pages (from-to)1610-1622
Number of pages13
JournalIEEE Transactions on Control Systems Technology
Volume24
Issue number5
DOIs
StatePublished - Sep 2016

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Keywords

  • Automated manufacturing systems (AMSs)
  • Petri nets
  • discrete event systems
  • distributed control
  • supervisor synthesis

Fingerprint

Dive into the research topics of 'Polynomially Complex Synthesis of Distributed Supervisors for Large-Scale AMSs Using Petri Nets'. Together they form a unique fingerprint.

Cite this