Unconstrained optimal control of regular languages (Q1433065)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2075427
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unconstrained optimal control of regular languages |
scientific article; zbMATH DE number 2075427 |
Statements
Unconstrained optimal control of regular languages (English)
0 references
15 June 2004
0 references
The present study deals with the theory, formulation, and validation of an unconstrained optimal control policy for finite state automata that may have already been subject to constraints such as control specifications. The synthesis procedure is quantitative and relies on a signed real measure of formal languages, which is based on a specified state transition cost matrix and characteristic vector. The control policy induced by the updated state transition cost matrix yields maximal performance and is unique in the sense that controlled language is most permissive (that is least restrictive) among all controller(s) having the optimal performance.
0 references
discrete event systems
0 references
optimal control
0 references
finite state
0 references
automata
0 references
language measure
0 references
0 references
0.9140984416007996
0 references
0.8792391419410706
0 references
0.8636279106140137
0 references
0.7991513609886169
0 references
0.7921507358551025
0 references
