Robust Optimal Control of Regular Languages

Research output: Contribution to journalConference articlepeer-review

9 Scopus citations


This paper presents an algorithm for robust optimal control of regular languages given uncertainty in event costs of a 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 supervised plant, minimized over the given range of event cost uncertainties. Synthesis of the robust optimal 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 open loop plant behavior. The computational complexity of control synthesis is polynomial in n.

Original languageEnglish (US)
Pages (from-to)3209-3214
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
StatePublished - 2003
Event42nd IEEE Conference on Decision and Control - Maui, HI, United States
Duration: Dec 9 2003Dec 12 2003

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization


Dive into the research topics of 'Robust Optimal Control of Regular Languages'. Together they form a unique fingerprint.

Cite this