In this paper, we propose an algorithmic method for a solution of the pole assignment problem which is associated with a higher order linear system, in the case it is completely controllable. The above problem is proved to be equivalent to two subproblems, one linear and the other multilinear. Solutions of the linear problem must be decomposable vectors, that is, they lie in an appropriate Grassmann variety. The method proposed computes a reduced set of quadratic Plucker relations with only three terms each, which describe completely the specific Grassmann variety. Using these relations one can solve the multilinear problem and consequently calculate the feedback matrices which give a solution to the pole assignment problem. Finally, an illustrative example of the algorithmic procedure proposed is given.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.