Publication Date:
2019-07-13
Description:
In this paper, a derivation is provided of the necessary condition, mp equal to or greater than n, for stabilizability by constant gain feedback of the generic degree n, p x m system. This follows from another of the main results, which asserts that generic stabilizability is equivalent to generic solvability of a deadbeat control problem, provided mp equal to or less than n. Taken together, these conclusions make it possible to make some sharp statements concerning minimum order stabilization. The techniques are primarily drawn from decision algebra and classical algebraic geometry and have additional consequences for problems of stabilizability and pole-assignability. Among these are the decidability (by a Sturm test) of the equivalence of generic pole-assignability and generic stabilizability, the semi-algebraic nature of the minimum order, q, of a stabilizing compensator, and the nonexistence of formulae involving rational operations and extraction of square roots for pole-assigning gains when they exist, answering in the negative a question raised by Anderson, Bose, and Jury (1975).
Keywords:
CYBERNETICS
Type:
Conference on Decision and Control; Dec 14, 1983 - Dec 16, 1983; San Antonio, TX
Format:
text
Permalink