Robust optimal control of regular languages

    Research output: Contribution to journalArticlepeer-review

    2 Scopus citations

    Abstract

    This paper presents an algorithm for robust optimal control of regular languages under specified uncertainty bounds on the event cost parameters of the language measure that has been recently reported in literature. The performance index for the proposed robust optimal policy is obtained by combining the measure of the supervised plant language with uncertainty. The performance of a controller is represented by the language measure of the supervised plant and is minimized over the given range of event cost uncertainties. Synthesis of the robust optimal supervisory control policy requires at most n iterations, where n is the number of states of the deterministic finite-state automaton (DFSA) model, generated from the regular language of the unsupervised plant behavior. The computational complexity of the control synthesis method is polynomial in n.

    Original languageEnglish (US)
    Pages (from-to)1439-1445
    Number of pages7
    JournalAutomatica
    Volume41
    Issue number8
    DOIs
    StatePublished - Aug 1 2005

    All Science Journal Classification (ASJC) codes

    • Control and Systems Engineering
    • Electrical and Electronic Engineering

    Fingerprint Dive into the research topics of 'Robust optimal control of regular languages'. Together they form a unique fingerprint.

    Cite this