Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
An algorithmic method is presented for the computation of a reduced set of quadratic Plucker relations describing completely the Grassmann variety of the corresponding projective space. In particular, it is proven that a set of three terms homogeneous equations can be extracted from the whole set of quadratic Plucker relations. This set contains a specific number of equations, which exactly-constitute a reduced set of quadratic Plucker relations. This is achieved by using a simple criterion based on a correspondence between the coordinates of a decomposable vector and lexicographical orderings. In addition, the algorithm suggested is error-free from numerical computations. The above theory is used for the development of a unifying approach for pole assignment by state and output feedback, for asymptotic observer design and for zero assignment by squaring down for linear time-invariant regular type control systems.
EN
The use of multirate generalized sampled-data hold functions for model reference adaptive control of linear multiple-input, multiple-output (MIMO) systems with unknown parameters, is investigated in this paper , for the firs time. Such a control scheme contains a multirate sampling mechanism with different sampling period to each system input and relies on two periodically varying modulating matrix functions. The proposed control strategy allows us to assign an arbitrary discrete-time transfer function matrix for the sampled close-loop system and does not make assumptions on the plant other than controllability and observability of the continuous and the sampled system, and the knowledge of a set of structural indices, namely the locally minimum controllability indices of the continuous-time plant. The indirect adaptive control scheme presented here, estimates the unknown plant parameters (and hence the parameters of the desired modulating matrix functions) on line, from sequential data of the inputs and the outputs of the plant, which are recursively updated within the time limit imposed by a fundamental sampling period T0. The controller determination is reduced to the simple problem of solving a linear algebraic system of equation, whereas known indirect model reference adaptive control techniques require the solution of matrix polynomial Diophantine equations, whose solution may become unstable. Moreover, persistency of excitation and, therefore, parameter convergence, of the continuous-time plant is provided without making assumptions either on the existence of specific convex sets in which the estimated parameters belong or on the coprimeness of the polynomials describing the ARMA model, or finally on the richness of the reference signals, as compared to known indirect model reference adaptive control schemes.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.