Optimal supervisory control of regular languages

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

This chapter presents optimal supervisory control of dynamical systems that can be represented by deterministic finite state automaton (DFSA) models. The performance index for the optimal policy is obtained by combining a measure of the supervised plant language with (possible) penalty on disabling of controllable events. The signed real measure quantifies the behavior of controlled sublanguages based on a state transition cost matrix and a characteristic vector as reported in Chapter 1 and earlier publications. Synthesis of the optimal control policy requires at most n iterations, where n is the number of states of the DFSA model generated from the unsupervised plant language. The computational complexity of the optimal control synthesis is polynomial in n. Syntheses of the control algorithms are illustrated with two application examples.

Original languageEnglish (US)
Title of host publicationQuantitative Measure for Discrete Event Supervisory Control
PublisherSpringer New York
Pages39-69
Number of pages31
ISBN (Print)0387021086, 9780387021089
DOIs
Publication statusPublished - Dec 1 2005

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

Ray, A., Fu, J., & Lagoa, C. (2005). Optimal supervisory control of regular languages. In Quantitative Measure for Discrete Event Supervisory Control (pp. 39-69). Springer New York. https://doi.org/10.1007/0-387-23903-0_2