A homotopy method for eigenvalue assignment using decentralized state feedback

From MaRDI portal





We address the following problem. Given an interconnected system M composed of N subsystems of the form \(A_ i+B_ iK_ i\), \(i=1,...,N\), \((A_ i,B_ i)\) controllable pairs and where the off-diagonal blocks of M lie in the image of the appropriate \(B_ i\), then is it possible to arbitrarily assign the characteristic polynomial of M by a suitable selection of the characteristic polynomials of \(A_ i+B_ iK_ i?\) Moreover, is it possible to compute the appropriate characteristic polynomials of the \(A_ i+B_ iK_ i\) (or, equivalently, construct the \(K_ i)\) needed to do so? The first question is answered by constructing a mapping \(F: {\mathbb{R}}^ n\to {\mathbb{R}}^ n\) which maps a prescribed set of n of the feedback gains (elements of \(K_ i\), \(i=1,...,N)\) to the n coefficients of the characteristic polynomial of M. The question then becomes, given a \(p\in {\mathbb{R}}^ n\), does \(F(x)=p\) have a solution? The answer is found by constructing a homotopy \(H: {\mathbb{R}}^ n\times [0,1]\to {\mathbb{R}}^ n\), where \(H(x,1)=F(x)\) and H(x,0) is some 'trivial' function. Degree theory is then applied to guarantee that there exists an x(t) such that \(H(x(t),t)=p\) for all t in [0,1]. The parameterized Sard's theorem is then utilized to prove that (with probability 1) x(t) is a 'smooth' curve, and hence can be followed numerically from x(0) to x(1) by the solution of a differential equation (Davidenko's method).











This page was built for publication: A homotopy method for eigenvalue assignment using decentralized state feedback

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4724498)