1,619 research outputs found
On pole assignment in multi-input controllable linear systems
Pole assignment in multi-input controllable linear system
Realization theory of rational transfer matrices
Realization theory of rational transfer matrices presented as fundamental algebraic objects in theory of finite, constant linear system
Optical stationary control of a linear system with state-dependent noise
Optical stationary control of linear control system with state dependent Gaussian nois
Supervisor Localization of Discrete-Event Systems based on State Tree Structures
Recently we developed supervisor localization, a top-down approach to
distributed control of discrete-event systems in the Ramadge-Wonham supervisory
control framework. Its essence is the decomposition of monolithic (global)
control action into local control strategies for the individual agents. In this
paper, we establish a counterpart supervisor localization theory in the
framework of State Tree Structures, known to be efficient for control design of
very large systems. In the new framework, we introduce the new concepts of
local state tracker, local control function, and state-based local-global
control equivalence. As before, we prove that the collective localized control
behavior is identical to the monolithic optimal (i.e. maximally permissive) and
nonblocking controlled behavior. In addition, we propose a new and more
efficient localization algorithm which exploits BDD computation. Finally we
demonstrate our localization approach on a model for a complex semiconductor
manufacturing system
A lyapunov method for the estimation of statistical averages
Liapunov method for estimation of statistical averages - application to control theory and theory of random vibratio
Automatic Reconfiguration of Untimed Discrete-Event Systems
This work introduces a general formulation of the reconfiguration problem for
untimed discrete-event systems (DES), which can be treated directly by
supervisory control theory (SCT). To model the reconfiguration requirements we
introduce the concept of reconfiguration specification (RS); here
reconfiguration events (RE) are introduced to force a transition from one
system configuration to another. Standard SCT synthesis is employed to obtain a
reconfiguration supervisor (RSUP) in which designated states serve as the
source states for RE. The reconfiguration problem itself is formulated as that
of establishing guaranteed finite reachability of a desired RE source state in
RSUP from the current state in RSUP at which a change in configuration is
commanded by an external user. The solvability (or otherwise) of this
reachability problem is established by backtracking as in standard dynamic
programming.Comment: 2017 14th International Conference on Electrical Engineering,
Computing Science and Automatic Control (CCE
- …