论文信息 - Pole assignment by state transition graph

Pole assignment by state transition graph

The pole assignment problem is considered, using the graph representation of a matrix. The parametrization of controllers which have a specified characteristic polynomial is given. A simple algorithm based on graphs is presented and two examples are given. >

H. Katayama | A. Ichikawa

[1] H. Katayama,et al. The design of deadbeat controllers by state transition graph , 1991 .

[2] J. O'Reilly,et al. Eigenstructure assignment in linear multivariable systems - A parametric solution , 1982, 1982 21st IEEE Conference on Decision and Control.

[3] On eigenvectors of the canonical matrix for multiple-input controllable systems , 1977 .

[4] Ian Petersen. A new extension to Kharitonov's theorem , 1987, 26th IEEE Conference on Decision and Control.

[5] T. Mita. On zeros and responses of linear regulators and linear observers , 1977 .

[6] G. Klein,et al. Eigenvalue-generalized eigenvector assignment with state feedback , 1977 .

[7] B. Moore. On the flexibility offered by state feedback in multivariable systems beyond closed loop eigenvalue assignment , 1975 .

[8] André L. Tits,et al. On the robust stability of polynomials with no cross-coupling between the perturbations in the coefficients of even odd powers , 1989 .

[9] J. O'Reilly,et al. On eigenstructure assignment in linear multivariable systems , 1982 .

[10] Jürgen Garloff,et al. Convex combinations of stable polynomials , 1985 .

[11] M. M. Fahmy,et al. The minimum number of degrees of freedom in state feedback control , 1985 .