Limited lookahead supervisory control of probabilistic discrete-event systems

Limited lookahead control policies adapt the concept of supervisor synthesis in discrete-event systems (DES) to work for very large and/or dynamic systems. This is accomplished by considering an N-step projection of possible behaviours of the system, instead of dealing directly with the entire system. This paper builds on previous work to produce a limited lookahead algorithm that incorporates probabilistic event occurrences and a desirability function for strings of events. An example is used to compare the results from this algorithm with those obtained using Markov chain analysis. Results are shown to be consistent, and future application of the algorithm to more complex problems is discussed.

[1]  Stéphane Lafortune,et al.  Supervisory control using variable lookahead policies , 1993, 1993 American Control Conference.

[2]  Vijay K. Garg,et al.  Control of stochastic discrete event systems modeled by probabilistic languages , 2001, IEEE Trans. Autom. Control..

[3]  R. Sengupta,et al.  An Optimal Control Theory for Discrete Event Systems , 1998 .

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

[5]  S. L. Chung.  Supervisory control using variable lookahead policies, for discrete event systems , 1994 .

[6]  S. Chung,et al.  Limited lookahead policies in supervisory control of discrete event systems , 1992 .

[7]  W. M. Wonham,et al.  Supervisory control of probabilistic discrete event systems , 1993, Proceedings of 36th Midwest Symposium on Circuits and Systems.

[8]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[9]  F. Lin,et al.  An optimal effective controller for discrete event systems , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).