Optimal Supervisory Control of Discrete Event DynamicalSystems

The notion of optimal supervisory control of discrete event dynamical systems (DEDSs) is formalized in the framework of Ramadge and Wonham. A DEDS is modeled as a state machine and is controlled by disabling some of its transitions. Two types of cost functions are defined: a cost of control function corresponding to disabling transitions in the state machine, and a penalty of control function corresponding to reaching some undesired states or not reaching some desired states in the controlled system. The control objective is to design an optimal control mechanism, if it exists, so that the net cost is minimized. Since a DEDS is represented as a state machine---a directed graph---network flow techniques are naturally applied for designing optimal supervisors. It is also shown that our techniques can be used to solve supervisory control problems under complete as well as partial observation. In particular, for the first time, techniques for computing the supremal controllable and normal sublanguage and the infimal controllable and normal/observable superlanguage without having to perform alternate computations of controllable and normal/observable languages are obtained.

[1]  M. Heymann,et al.  Stabilization of discrete-event processes , 1990 .

[2]  P. Ramadge,et al.  Modular feedback logic for discrete event systems , 1987 .

[3]  M. Heymann,et al.  On stabilization of discrete-event processes , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

[4]  John N. Tsitsiklis,et al.  On the control of discrete-event dynamical systems , 1987, 26th IEEE Conference on Decision and Control.

[5]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[6]  Steven I. Marcus,et al.  On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation , 1989, Math. Control. Signals Syst..

[7]  Michael Heymann,et al.  On optimal attraction in discrete-event processes , 1993, Inf. Sci..

[8]  W. Wonham,et al.  The infimal prefix-closed and observable superlanguage of given language , 1991 .

[9]  A. Willsky,et al.  Observability of discrete event dynamic systems , 1990 .

[10]  P. Ramadge,et al.  On the supermal controllable sublanguage of a given language , 1987 .

[11]  S. Marcus,et al.  On controllability and normality of discrete event dynamical systems , 1991 .

[12]  A. Willsky,et al.  Stability and stabilization of discrete event dynamic systems , 1991 .

[13]  Vijay K. Garg,et al.  A State-Variable Approach for Controlling Discrete Event Systems with Infinite States , 1992, 1992 American Control Conference.

[14]  C. Desclaux,et al.  Supervisory control of discrete-event processes with partial observations , 1988 .

[15]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[16]  R. D. Brandt,et al.  Formulas for calculating supremal controllable and normal sublanguages , 1990 .

[17]  K. Passino,et al.  On the optimal control of discrete event systems , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

[18]  S. Marcus,et al.  Language stability and stabilizability of discrete event dynamical systems , 1993 .

[19]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[20]  Walter Murray Wonham,et al.  On observability of discrete-event systems , 1988, Inf. Sci..