Unconstrained optimal control of regular languages (Q1433065): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
| Property / cites work | |||
| Property / cites work: Optimal Supervisory Control of Discrete Event Dynamical Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear operator theory in engineering and science. Repr. of the 1971 orig., publ. by Holt, Rinehart \& Winston, Inc. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Supervisory Control of a Class of Discrete Event Processes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Optimal Control Theory for Discrete Event Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: MEASURE OF REGULAR LANGUAGES / rank | |||
Normal rank | |||
Latest revision as of 16:59, 6 June 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
0 references
