Approximating minimal communicated event sets for decentralized supervisory control

Kurt R. Rohloff, Jan H. Van Schuppen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

This paper discusses the problem of selecting the minimal set of events to be communicated between decentralized supervisory controllers in order for the behavior of a controller system to match a given specification. This optimization problem is known to be computationally difficult, so this paper discusses the problem of approximating this set of communicated events. It is shown how the communication minimization problem is related to a centralized supervisory control minimal sensor selection problem and a special type of directed graph st-cut problem. Polynomial time algorithms to approximate solutions to these problems most likely do not exist (using worst-case analysis), but several effective heuristic approximation methods are shown for these problems that work well for average cases.

Original languageEnglish (US)
Title of host publicationProceedings of the 16th IFAC World Congress, IFAC 2005
Pages151-156
Number of pages6
StatePublished - 2005
Externally publishedYes
Event16th Triennial World Congress of International Federation of Automatic Control, IFAC 2005 - Prague, Czech Republic
Duration: Jul 3 2005Jul 8 2005

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
Volume16
ISSN (Print)1474-6670

Other

Other16th Triennial World Congress of International Federation of Automatic Control, IFAC 2005
Country/TerritoryCzech Republic
CityPrague
Period7/3/057/8/05

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering

Keywords

  • Approximation algorithms
  • Decentralized control systems
  • Discrete-event systems
  • Heuristics
  • Supervisory control

Fingerprint

Dive into the research topics of 'Approximating minimal communicated event sets for decentralized supervisory control'. Together they form a unique fingerprint.

Cite this