Unconstrained optimal control of regular languages (Q1433065): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.automatica.2003.11.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2158941525 / rank | |||
Normal rank | |||
Revision as of 18:10, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unconstrained optimal control of regular languages |
scientific article |
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
