DocumentCode :
2822517
Title :
Language-measure-theoretic optimal control of probabilistic finite-state systems
Author :
Chattopadhyay, Ishanu ; Ray, Asok
Author_Institution :
Pennsylvania State Univ., University Park
fYear :
2007
fDate :
12-14 Dec. 2007
Firstpage :
5930
Lastpage :
5935
Abstract :
Supervisory control theory for discrete event systems, introduced by Ramadge and Wonham, is based on a non-probabilistic formal language framework. 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 language measure vector for the controlled plant behavior and is efficiently computable.
Keywords :
discrete event systems; optimal control; probability; discrete event systems; discrete-event supervisor; language-measure-theoretic optimal control; probabilistic finite-state systems; supervisory control theory; Automata; Control systems; Discrete event systems; Formal languages; Linear matrix inequalities; Optimal control; Performance analysis; Q measurement; Supervisory control; USA Councils; Discrete Event Systems; Finite Markov Chains; Language Measure; Supervisory Control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control, 2007 46th IEEE Conference on
Conference_Location :
New Orleans, LA
ISSN :
0191-2216
Print_ISBN :
978-1-4244-1497-0
Electronic_ISBN :
0191-2216
Type :
conf
DOI :
10.1109/CDC.2007.4434495
Filename :
4434495
Link To Document :
بازگشت