Results 261 to 270 of about 10,126 (307)
Some of the next articles are maybe not open access.
Parametric Pole Assignment and Robust Pole Assignment for Discrete-Time Linear Periodic Systems
SIAM Journal on Control and Optimization, 2010This 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 ...
Lingling Lv, Guang-Ren Duan, Bin Zhou
exaly +2 more sources
Pole assignment with optimal performance [PDF]
Proceedings of the 1998 American Control Conference. ACC (IEEE Cat. No.98CH36207), 1998 A unified gradient-based treatment for optimizing certain performance indices under the constraint of pole assignment is provided. By introducing a free optimization parameter and solving a Sylvester matrix equation, compact gradient formulas are derived for general purpose gradient descent numerical implementation.
Lam, J, Hu, TS
openaire +3 more sources
Regional pole assignment with eigenstructure robustness
International Journal of Systems Science, 1997 The paper provides a computational procedure for a type of robust regional pole assignment problem. It allows closed-loop poles to be settled at certain perturbation insensitive locations within some prespecified regions in the complex plane. The novelty of our approach lies in the versatility of the proposed algorithm which provides a rick set of ...
James Lam, Hei Ka Tam
openaire +2 more sources
Robust partial pole assignment problem for high order control systems
Automatica, 2012 In this paper, we consider the partial pole assignment problem (PPAP) for high order control systems. It is shown that solving the PPAP is essentially solving a pole assignment for a linear system of a much lower order, and the robust PPAP is then ...
Yunfeng Cai, Shu-Fang Xu
exaly +2 more sources
Pole assignment for systems over rings
Systems and Control Letters, 1982 A very simple proof of the pole assignment theorem for systems over a principal ideal domain (and other rings) is given. Furthermore, an algorithm is presented. Extensions are also indicated.
Eising, R Rikus, Eising, R.
exaly +2 more sources
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
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, 2022A 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, 1995This 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 numerically reliable approach to robust pole assignment for descriptor systems
Future Generation Computer Systems, 2003 We propose a general, numerically reliable computational approach to solve the pole and eigenstructure assignment problem for descriptor systems. In the multi-input case, the proposed approach addresses the intrinsic non-uniqueness of the pole assignment
A. Varga, Varga, Andras
exaly +1 more source
Robust pole assignment in uncertainsystems
IEE Proceedings - Control Theory and Applications, 1997The concept of 'pole colouring' is introduced as a graphical aid to the problem of observing the closed-loop system pole variations as a function of uncertainty. Some possible cost functions that can be used to measure the performance robustness of the resulting systems are also considered.
Söylemez, M. T., Munro, N.
openaire +1 more source