This paper presents an algorithm for optimal control of regular languages with penalty on event disabling. The performance index for the proposed optimal policy is obtained by combining the measure of the supervised plant language with the cost of disabled event(s). Synthesis of this optimal control policy requires at most n iterations, where n is the number of states of the DFSA model generated from the (open loop) regular language. The computational complexity of control synthesis is of a polynomial order in n.
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering