Unconstrained optimal control of regular languages
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.
- An Optimal Control Theory for Discrete Event Systems
- Linear operator theory in engineering and science. Repr. of the 1971 orig., publ. by Holt, Rinehart \& Winston, Inc.
- MEASURE OF REGULAR LANGUAGES
- Optimal Supervisory Control of Discrete Event Dynamical Systems
- Supervisory Control of a Class of Discrete Event Processes
- Reducing control alphabet size for the control of right linear grammars with unknown behaviors
- On-line identification of language measure parameters for discrete-event supervisory control
- Robust optimal control of regular languages
- Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems
- Optimal supervisory control of finite state automata
- OPTIMAL SUPERVISORY CONTROL OF REGULAR LANGUAGES
- Optimal supervisory control of discrete event systems for cyclic tasks
This page was built for publication: Unconstrained optimal control of regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433065)
