论文信息 - Decoupling problem for structured systems via a primal-dual algorithm

Decoupling problem for structured systems via a primal-dual algorithm

In this paper, we give a polynomial efficient algorithm to check the solvability of the decoupling problem by state feedback for structured systems. A directed graph is associated with such structured systems. The solvability of this problem is based on the primal-dual algorithm linked to linear programming.

[1] J. Descusse,et al. On the structure at infinity of linear square decoupled systems , 1982 .

[2] Christian Commault,et al. Output feedback disturbance decoupling graph interpretation for structured systems , 1993, Autom..

[3] P. Falb,et al. Decoupling in the design and synthesis of multivariable control systems , 1967, IEEE Transactions on Automatic Control.

[4] Kazuo Murota,et al. Systems Analysis by Graphs and Matroids , 1987 .

[5] J. Dion,et al. Analysis of linear structured systems using a primal-dual algorithm , 1996 .

[6] J. Dion,et al. Disturbance rejection for structured systems , 1990, 29th IEEE Conference on Decision and Control.

[7] Ching-tai Lin. Structural controllability , 1974 .

[8] Ferdinand Svaricek,et al. An improved graph-theoretic algorithm for computing the structure at infinity of linear systems , 1990, 29th IEEE Conference on Decision and Control.

[9] J. W. van der Woude,et al. On the structure at infinity of a structured system , 1991 .

[10] Kurt Johannes Reinschke,et al. Multivariable Control a Graph-theoretic Approach , 1988 .

[11] Arno Linnemann,et al. Decoupling of structured systems , 1981 .

[12] Jan Jantzen,et al. Digraph Programs for Multivariable Control , 1995 .

[13] J. Dion,et al. Feedback decoupling of structured systems , 1993, IEEE Trans. Autom. Control..