Language-measure-theoretic optimal control of probabilistic finite-state systems

I. Chattopadhyay, A. Ray

Research output: Contribution to journalArticle

28 Scopus citations

Abstract

Supervisory control theory for discrete event systems, introduced by Ramadge and Wonham, is based on a non-probabilistic formal language framework. However, models for physical processes inherently involve modelling errors and noise-corrupted observations, implying that any practical finite-state approximation would require consideration of event occurrence probabilities. Building on the concept of signed real measure of regular languages, this paper formulates a comprehensive theory for optimal control of finite-state probabilistic processes. It is shown that the resulting discrete-event supervisor is optimal in the sense of elementwise maximizing the renormalized langauge measure vector for the controlled plant behaviour and is efficiently computable. The theoretical results are validated through several examples including the simulation of an engineering problem.

Original languageEnglish (US)
Pages (from-to)1271-1290
Number of pages20
JournalInternational Journal of Control
Volume80
Issue number8
DOIs
StatePublished - Aug 1 2007

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Language-measure-theoretic optimal control of probabilistic finite-state systems'. Together they form a unique fingerprint.

  • Cite this