Unconstrained optimal control of regular languages

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

This paper formulates an unconstrained optimal policy for control of regular languages realized as deterministic finite state automata (DFSA). A signed real measure quantifies the behavior of controlled sublanguages based on a state transition cost matrix and a characteristic vector as reported in an earlier publication. The state-based optimal control policy is obtained by selectively disabling controllable events to maximize the measure of the controlled plant language without any further constraints. Synthesis of the optimal control policy requires at most n iterations, where n is the number of states of the DFSA model. Each iteration solves a set of n simultaneous linear algebraic equations. As such, computational complexity of the control synthesis is polynomial in n.

Original languageEnglish (US)
Pages (from-to)639-646
Number of pages8
JournalAutomatica
Volume40
Issue number4
DOIs
StatePublished - Apr 1 2004

Fingerprint

Formal languages
Finite automata
Linear equations
Computational complexity
Polynomials
Costs

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

@article{7e27afd54e5146dab2e645165ec5df67,
title = "Unconstrained optimal control of regular languages",
abstract = "This paper formulates an unconstrained optimal policy for control of regular languages realized as deterministic finite state automata (DFSA). A signed real measure quantifies the behavior of controlled sublanguages based on a state transition cost matrix and a characteristic vector as reported in an earlier publication. The state-based optimal control policy is obtained by selectively disabling controllable events to maximize the measure of the controlled plant language without any further constraints. Synthesis of the optimal control policy requires at most n iterations, where n is the number of states of the DFSA model. Each iteration solves a set of n simultaneous linear algebraic equations. As such, computational complexity of the control synthesis is polynomial in n.",
author = "Jinbo Fu and Asok Ray and Lagoa, {Constantino Manuel}",
year = "2004",
month = "4",
day = "1",
doi = "10.1016/j.automatica.2003.11.011",
language = "English (US)",
volume = "40",
pages = "639--646",
journal = "Automatica",
issn = "0005-1098",
publisher = "Elsevier Limited",
number = "4",

}

Unconstrained optimal control of regular languages. / Fu, Jinbo; Ray, Asok; Lagoa, Constantino Manuel.

In: Automatica, Vol. 40, No. 4, 01.04.2004, p. 639-646.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Unconstrained optimal control of regular languages

AU - Fu, Jinbo

AU - Ray, Asok

AU - Lagoa, Constantino Manuel

PY - 2004/4/1

Y1 - 2004/4/1

N2 - This paper formulates an unconstrained optimal policy for control of regular languages realized as deterministic finite state automata (DFSA). A signed real measure quantifies the behavior of controlled sublanguages based on a state transition cost matrix and a characteristic vector as reported in an earlier publication. The state-based optimal control policy is obtained by selectively disabling controllable events to maximize the measure of the controlled plant language without any further constraints. Synthesis of the optimal control policy requires at most n iterations, where n is the number of states of the DFSA model. Each iteration solves a set of n simultaneous linear algebraic equations. As such, computational complexity of the control synthesis is polynomial in n.

AB - This paper formulates an unconstrained optimal policy for control of regular languages realized as deterministic finite state automata (DFSA). A signed real measure quantifies the behavior of controlled sublanguages based on a state transition cost matrix and a characteristic vector as reported in an earlier publication. The state-based optimal control policy is obtained by selectively disabling controllable events to maximize the measure of the controlled plant language without any further constraints. Synthesis of the optimal control policy requires at most n iterations, where n is the number of states of the DFSA model. Each iteration solves a set of n simultaneous linear algebraic equations. As such, computational complexity of the control synthesis is polynomial in n.

UR - http://www.scopus.com/inward/record.url?scp=1242264908&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1242264908&partnerID=8YFLogxK

U2 - 10.1016/j.automatica.2003.11.011

DO - 10.1016/j.automatica.2003.11.011

M3 - Article

AN - SCOPUS:1242264908

VL - 40

SP - 639

EP - 646

JO - Automatica

JF - Automatica

SN - 0005-1098

IS - 4

ER -