Abstract

Supervisory control in the context of /spl omega/-languages is considered. The nominal supervisor design problem is to find a nonblocking supervisor f for a plant G/sub 0/ such that the closed-loop infinite behavior equals a specified closed-loop behavior K satisfying lower and upper bounds, (A/spl cap/S(G/sub 0/))/spl sub/K/spl sub/(E/spl cap/S(G/sub 0/)), S(G/sub 0/) being the open-loop infinite behavior of G/sub 0/. The robustness of solutions to the nominal problem is defined with respect to variations in the plant. It is shown there exists a supervisor f* which solves the nominal problem and maximizes the set of plants for which the nominal specifications are satisfied under the supervisor f*. Computational issues are discussed and the theoretical results are illustrated with an example.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call