TY - GEN
T1 - Approximating minimal communicated event sets for decentralized supervisory control
AU - Rohloff, Kurt R.
AU - Van Schuppen, Jan H.
N1 - Funding Information:
1 This paper reports on work commenced while the first author was visiting CWI during the summer of 2003. The first author would like to acknowledge the helpful comments and discussions from Stéphane Lafortune of The University of Michigan. Financial support in part for the investigation was made available by the European Commission through the project Control and Computation (IST-2001-33520) of the Information Society Technologies Program. K. Rohloff was also supported by NSF grants CCR-0082784, CCR-0325571 and CCR 00-85917 ITR.
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
KW - Approximation algorithms
KW - Decentralized control systems
KW - Discrete-event systems
KW - Heuristics
KW - Supervisory control
UR - http://www.scopus.com/inward/record.url?scp=79960730483&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79960730483&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:79960730483
SN - 008045108X
SN - 9780080451084
T3 - IFAC Proceedings Volumes (IFAC-PapersOnline)
SP - 151
EP - 156
BT - Proceedings of the 16th IFAC World Congress, IFAC 2005
T2 - 16th Triennial World Congress of International Federation of Automatic Control, IFAC 2005
Y2 - 3 July 2005 through 8 July 2005
ER -