A Graph Formulation of Some Supervisory Control Problems 1993 IEEE Systems, Man and Cybernetics Conference Proceedings
Jean-Claude Hennet · 1993
The paradigm of supervisory control can be applied to many discrete event systems. In the particular case of Semi-Markov Decision prob- lems, control actions often consist of removing some controllable probability transitions, to prevent the system from reaching sets of undesirable states. The choice of the transitions to be removed can be based on the minimization of a long range average cost cri- terion. The graph interpretation of the optimal su- pervisory control problem for a Semi-Markov Chain can then be formulated as a minimal cost cut prob- lem.