Results 241 to 250 of about 99,181 (304)

Parametric Pole Assignment and Robust Pole Assignment for Discrete-Time Linear Periodic Systems

SIAM Journal on Control and Optimization, 2010
This paper considers pole assignment and robust pole assignment problems for discrete-time linear periodic systems by using linear periodic state feedback. The monodromy matrix of the closed-loop system is represented in a special form. By combining this special form with our recent result on solutions to a class of generalized Sylvester matrix ...
Ling-Ling Lv, Guang-Ren Duan, Bin Zhou
exaly   +2 more sources

Pole assignment via the schur form

Systems and Control Letters, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eric Chu
exaly   +2 more sources

Robust pole assignment

Automatica, 1987
This paper presents new theorems on the theory of interval matrix inequalities and the theory of polynomials with interval roots, and applies them to the problem of robust pole-placement. We formulate optimization problems and derive convergent iterative algorithms which allow the designer to find controllers that place closed-loop poles within desired
Yeng C. Soh   +3 more
openaire   +2 more sources

A method for robust quadratic pole assignment

Transactions of the Institute of Measurement and Control, 2022
A new method is proposed for robust quadratic pole assignment problem. We first give the results on the solution of quadratic pole assignment problem. Then the Schur form corresponding to closed-loop system is established and normality departure is used to measure the robustness of closed-loop system.
Manhong Lu, Huiqing Xie
openaire   +1 more source

Pole assignment with robust stability

IEEE Transactions on Automatic Control, 1995
This paper uses convex analysis for the pole assignment design of discrete-time SISO systems incorporating robust stability against norm bounded parametric perturbations in the plant transfer function. The method involves designing an overparameterized pole assignment controller for the nominal plant with the overparameterization chosen to reduce the ...
Mark E. Halpern   +2 more
openaire   +2 more sources

A note on pole assignment

IEEE Transactions on Automatic Control, 1972
This note gives an alternate proof of Davison's theorem [2] on pole placement and further shows that, for a controllable, observable system \dot{x} = \hat{A}x + \hat{B}u, y = \hat{C}x , the number of poles that can be assigned arbitrarily are equal to max ( m,p ), where m Rank \hat{B} and p = Rank \hat{C} .
B. Sridhar, D. Lindorff
openaire   +1 more source

Home - About - Disclaimer - Privacy