\(L^ 1\) sensitivity minimization for plants with commensurate delays (Q1192597): Difference between revisions

The paper studies the \(L^ 1\) sensitivity minimization problem for linear plants with commensurate delays. Such plants have the form \(P=UP_ 0\) with \(P_ 0\) a stable system with stable inverse, and \(U\) a polynomial matrix of delays. The \(L^ 1\)-sensitivity minimization requires bringing to the minimum over all stabilizing controllers \(C\), i.e. minimize \(\| W(I+PC)^{-1}\|\), where \(\|\cdot\|\) denotes the operator norm. The solution of this problem is obtained by computing an infinite number of linear programming problems. A few examples illustrate the developed theory.