Investigation and Synthesis of Robust Polynomials in Uncertainty on the Basis of the Root Locus Theory

The root locus method is proposed in the chapter for searching intervals of uncertainty for coefficients of the given (source) polynomial with constant or interval coefficients under perturbations, which ensures its robust stability regard-less of whether the given polynomial is Hurwitz or not. The method is based on introduction and application of the “ extended root locus ” notion. Polynomial adjustment is performed by setting up each one of its coefficients separately and sequentially and determining permissible values of coefficient variation intervals (intervals of uncertainty). The effect of each coefficient variation upon the polynomial root dynamics (behavior) is considered and analyzed separately, and this influence could be observed in the root locus portraits. Root locus method is thus generalized to the cases when the number of polynomial variable coefficients is arbitrary. The root locus parameter distribution diagram along the asymptotic stability bound is introduced and applied for observing the roots behavior regularities. On this basis, the stability conditions are derived, and analytical and graphic-ana-lytical methods are worked out for calculating intervals of variation for the 4th order polynomial family parameters ensuring its robust stability. It also allows to extract Hurwitz subfamilies from the non-Hurwitz families of interval polynomials and to determine whether there exists at least one stable polynomial in the unstable polynomial family.


Introduction
As it is emphasized in [1,2], the tasks of analysis and synthesis of control processes occurring in dynamic systems of different physical nature, operating in conditions of substantial plant parametric uncertainty, including the engineering ones, are currently the most urgent and challenging within the framework of the control theory. Among these tasks, one could mention the problem of flux control for the electric motor vector control systems operating in uncertainty because the flux control quality strongly affects the electromagnetic torque and speed control quality, and thus the drive power efficiency. For this reason, of great importance are the tasks of stability investigation and parametric synthesis of robust control systems (their characteristic polynomials) for the plants which parameters vary within the given or unknown intervals of values.
In the area of investigation and synthesis of dynamic system characteristic polynomials, there exists a lot of approaches and methods. For the first time, the necessary and sufficient conditions for systems up to the 3-rd order were formulated by James Maxwell in 1868. Later appeared the stability criteria of Routh-Hurwitz, Mikhajlov, Nyquist, and Bode, which made it possible to check stability of the systems of order n. The frequency Nyquist criterion was the first one that could be used for synthesis by estimation of the system degree of stability. Among the modern methods of synthesis [1,2] together with the frequency ones, the root locus and state-space methods could be listed. In his book [1], Jurgen Ackermann gives, in particular, the algebraic approach to uncertainty considering different, including the nonlinear, types of the coefficient functions and generating stability regions in the parameter space of real physical parameters of the system (polynomial). The main results in the area of the frequency approach to analysis and synthesis of robust dynamic (control) systems are given in [3], where the stability of uncertain polynomials, including interval ones, is also considered.
The methods for analysis and synthesis of polynomial families represent a separate group. One of the most effective solutions for the task of interval polynomial family investigation within the algebraic approach has been proposed by Kharitonov [4], where in the general case, the task of polynomial stability analysis is reduced to consideration of only four specific polynomials of the whole family with constant coefficients. In [3,5], the frequency criteria of Hurwitz robust stability are considered, which allow to define the coefficient perturbation sweep for the nominally stable polynomial and various types of uncertainties. Hurwitz robust stability is also investigated in [6][7][8][9][10]. In [6], the maximal deviation intervals of perturbed Hurwitz polynomial coefficients assuring strict Hurwitz property are determined on the basis of the algebraic method worked out using Kharitonov's polynomials [4]. The similar task is solved in [7] but using the Hermite-Biler theorem, which allows to reduce twice the power of investigated polynomial. The way for calculation of perturbed polynomial coefficients' maximal limit values that guarantee sector stability is given in [8]. The linear dependence of coefficient perturbation is considered by Bartlett, et al. for a class of polynomial families generated by convex polytopes in the coefficient space [9]. Here the so-called edge theorem was proved assuring derivation of the stability analysis task to investigation of root location for the finite number of the parametric families. The edge theorem allows to analyze both stability and quality characteristics of the family. A combination of the stochastic and worst-case approaches to the problem of uncertainty is proposed in [10]. It certainly widens the scope of types of treatable uncertainties and reduces conservatism. However, it works properly only in the cases permitting an arbitrarily small probability of specification violation. Thus, to the specific extent, it still bears the drawbacks of the stochastic approach to control, which guarantees only the "average" performance.
An analog of Kharitonov theorem [11] was formulated for the unstable interval polynomials' homogeneous classes of equivalence. Criteria of existence of such classes of equivalence were obtained. Based on the new interval polynomial stability criterion and Lyapunov theorem, a robust optimal proportional-integral-derivative (PID) controller is proposed in paper [12] to carry out design for different plants that contain perturbations of multiple parameters. A new stability criterion of the interval polynomial is presented to determine whether the interval polynomial belongs to Hurwitz polynomial or not. Time-delay systems involving multiple imaginary roots (MIRs) and their stability analysis, which becomes much more complicated than that in the case with only simple imaginary roots, are treated in [13]. For a class of time-delay systems, it was proved that the invariance between the multiple imaginary roots and the simple imaginary roots holds for any multiplicity as well as for the degenerate cases. In paper [14], monic complex polynomials are identified with the sets of their roots instead of being identified with the vectors of their coefficients. A proof is given that the space of Hurwitz polynomials of degree n with positive (resp. negative) coefficients is contractible and also that the space of monic (Schur or Hurwitz) aperiodic polynomials is contractible. A computational method to verify the stability of a convex combination of polynomials is considered in [15] and aimed at the robust stability analysis of a linear system. A simple algebraic test (a matrix inequality) for the stability of the segment of polynomials determined by the given two Hurwitz stable polynomials is proposed. Kučera gives a survey [16] where he navigates the area of the polynomial approach in the control system design technique. Such areas as parameterization of stabilizing controllers, called Youla-Kučera parameterization, are explained; the results on reference tracking, disturbance elimination, pole placement, deadbeat control, robust stabilization, and some others are described.
Of great interest are the problems of ensuring system stability and quality being solved in the modern statements of the problem [2] as tasks of guaranteeing system robustness, which could be solved by application of the root locus approach. The basic benefit of this approach is that its application itself, by its nature, implies parametric variations (i.e., uncertainty). The root locus approach is a powerful method used for the system synthesis [2] and is notable for its descriptiveness ensuring both calculation of the system robust parameters' values and possibility of detailed overview of the dynamic properties variation changes, the system response to uncertainties that is particularly important when investigating systems with uncertain and in particular interval parameters.
Root locus approach to the problem is considered in [17][18][19][20][21][22][23]. Paper [17] gives a solution for a compensator synthesis on the basis of the root locus method application. The task of a stable characteristic polynomial synthesis for the interval dynamic system (IDS) by setting up coefficients of the given (initial) unstable one for the case of location of its root locus initial point (where the variable parameter is equal to zero) family within the left half-plane is solved in [21], where the stability is attained via simple setting up the interval of the free term variation.
The above analyzed literature covers various approaches to the uncertainty treatment. However, most of the theoretical works are focused on the tasks of robust stability analysis. The methods for synthesis are not that widely represented, often suffer from complexity and in most cases are enough narrow, which means that they certainly provide instruments for system synthesis, but they are mostly "closed on themselves," which means that they do not provide the complete picture in the sense of showing up what is happening "under cover," which is especially important for the qualitative robust system (polynomials) synthesis. The root locus approach is rarely applied even though it represents the dynamic picture of the system response to uncertainties in the most comprehensive way and thus seems to be the most suitable one to deal with uncertainties.
As for polynomial families, the root locus approach gives us the transparent picture of root dynamics making it possible to see as if from the inside, for example, what subfamilies constitute the whole family of uncertain polynomials in terms of their configuration and stability or some other dynamic indicators bearing significant information about the system behavior and thus leading the way for its investigation and synthesis.
In this work, the root locus methods are described for calculating intervals of uncertainty for coefficients of the given (initial) stable or unstable polynomial with coefficients subject to perturbations, which ensure its robust stability. The proposed methods are based on introduction and application of the notions "extended root locus," "diagram of the root locus parameter function values distribution along the stability bound" and can be used for both synthesis of interval stable polynomials by setting up (adjusting) the unstable ones and analysis of the polynomial behavior under coefficient perturbations. The influence of every coefficient upon the polynomial behavior could be observed.
The work further develops results represented in the papers of Anderson [22] and Kharitonov [4] where they consider the issues of analysis and synthesis of robust interval polynomial families.

The problem formulation
Define a polynomial like g n s ð Þ ¼ s n þ a 1 s n-1 þ … þ a n-1 s þ a n , where a j are given (initial) values of real polynomial coefficients, j = 1, 2, …, n.
In the event of coefficient perturbations, a vector of coefficients of (1), a = (a 1 , …, a n-1 , a n ), belongs to some connected set A ⊂ R n , a ∈ A; n is a degree of the polynomial (integer value); s is a complex variable, s = σ + iω.
Suppose that coefficients of (1) vary within the following intervals: a j ≤ a j ≤ a j , j ¼ 1, n: where a j and a j are the minimal and maximal limit values of closed interval (2) of coefficients a j variation correspondingly. Polynomial (1) can be both, non-Hurwitz or Hurwitz one.
After substituting s = σ + iω, write the root locus and parameter equations [18] where u(σ,ω) and v(σ,ω) are the real functions of two independent variables σ and ω.
The root locus method represents a powerful and effective tool for stable and qualitative polynomial synthesis and analysis. However, as it is known, this method allows to consider polynomials with only a single variable coefficient (parameter) and cannot be applied in the cases when all coefficients are uncertain. Therefore, the task is to generalize the root locus method for the cases when the number of variable coefficients is arbitrary and thus to solve the problem of investigation of the uncertain polynomial dynamics and working out methods for synthesis of the robustly stable uncertain (interval) polynomial by setting up the given polynomial (non-Hurwitz or Hurwitz) with constant/variable coefficients and determining intervals of all its coefficients (stability intervals) assuring its robust stability.
3. Root locus portraits of uncertain polynomials Definition 1. The algebraic equation coefficient or the parameter of the dynamic system, described by this algebraic equation, which is being varied in a definite way for generating the root locus, when it is assumed that all the rest coefficients (parameters) are constant, is called the root locus parameter or free parameter.
If the root locus parameter is a j , it is named the root locus relative to parameter (coefficient) a j .
Definition 2. The root locus relative to the algebraic equation free term is called the free root locus.
Definition 3. Points, where the root locus branches begin and where the root locus parameter is equal to zero are called the root locus initial points.
Definition 4. The family P of root loci of interval polynomial (1) with coefficients varying within (2) name as the interval polynomial root locus portrait (interval polynomial root locus) or interval dynamic system root locus portrait (interval dynamic system root locus).
Let us along with the parameter a n vary also parameter a n-1 of (1). Thus, we generate a (free) root locus field F k (k = 1. 2, …) in the plane s of system roots, which could also be named a two-parameter root locus field or a (interval) root locus subfamily. Parameter a n-1 used for the field generation is named a root locus field parameter.
It is evident that the root locus Eq. (3) represents also the equation of level lines of the free root locus field F k . Root locus portrait P is then represented by the family of root locus fields, that represents the infinite set of root locus fields and therefore possesses their properties, and from the mathematical point of view, all root locus fields of P feature the same qualities. Therefore, the portrait P can be investigated as a single root locus field F k .
Hereinafter the term "root locus" is used in the sense of "Teodorchik -Ewans free root locus" [18].

Polynomial analysis and synthesis based on the extended root locus 4.1 Extended root locus
Introduce the following system of polynomials: where i-sequential number of the polynomial in (6), which is equal to its degree, i ¼ 1, n; a j -coefficients, j ¼ 1, i.
Every polynomial (8) of (iÀ1) degree is generated from the i-degree polynomial supposed that a i = 0. Polynomials of (6) have common coefficients, but not common roots.
Definition 5. System of polynomials (6) name as the extension of polynomial (1) or extended polynomial. Definition 6. Complete set of extension (6) root loci name as the extended root loci of (1).
Extension E n of polynomial g n (s) could be represented by the finite set of polynomials, Statement 1. In case of variation of any coefficient a j ,j ¼ 1, i À 1 ð Þ, of polynomial g i (s) (7) within the specific interval, a j ≤ a j ≤ a j , every initial point of its free root locus (excluding the point located at the origin) moves along its unique trajectory, representing itself one of the branches of polynomial g iÀ1 (s) (8) root locus, generated relative to this coefficient, and its current position is determined at a point corresponding to the current value of a j .
Proof. As at initial points of polynomial (6) free root locus the free term a j is equal to zero, it is evident that (8) represents the equation of initial points of the free root locus of (6), that is, when varying a j j ¼ 1, i À 1 ð Þ , the root locus of (8) relative to a j represents the geometric place of initial points of the root locus of (7). Therefore, every initial point of the free root locus of (7) at fixed a j coincides in the complex plane s with one of the polynomial (8) roots at the given value of a j . It is evident, that while varying a j , this root (and hence, this initial point) moves in the complex plane s, generating one of the (i -1) branches (trajectories) of the root loci of (8) relative to a j . Thus, the statement has been proved. Definition 7. Name g iÀ1 (s) (8) as the originative polynomial relative to g i (s) (7) and the root locus of (8)-the originative root locus of polynomial (7) free root loci.
Consequence 1. In case of continuous variation of the polynomial g i (s) coefficient a j , j ¼ 1, n À 1 ð Þ, every branch of this polynomial root locus, initiated at the specific initial point, migrates continuously along the corresponding branch of the originative root locus relative to a j-1 , being the trajectory of this initial point, correspondingly in direction of increase or decrease of the originative root loci parameter a j . Consequence 2. If polynomial g i-1 (s) being the originative one for the polynomial g i (s) is asymptotically stable, all initial points of polynomial g i (s) free root locus, excluding zero one, are located in the left half-plane s: where s i μ -roots of g i (s); p i μ -initial points of polynomial g i (s) free root locus; μroot (initial point) sequential number, μ ¼ 1, i À 1.
Further in the text, polynomial g i-1 (s) free root locus is referred to as the originative one relative to that of g i (s) and g i (s) free root locus-as the originated one relative to that of g i-1 (s). Statement 1 is illustrated by Figures 1 and 2. Initial points here are designated by signs "x" (crosses) and letters "p" with the lower indexes, designating the point sequential numbers, and upper indexes, designating the sequential numbers of the corresponding root locus. The root locus sequential number is indicated by a digit next to its corresponding branch.   3) in the sense of four following possible cases: n is uneven, (n -1)/2 is even/uneven, n is even, and n/2 is even/uneven. The root locus parameter equations (as it is in the general form see (4)) are composed in the same way.
Specify the set A þ i of a i values at the cross points of polynomial (7) root locus positive branches with axis ω: where n þ i is a number of cross points. Statement 2. If all initial points of polynomial (7) root locus, excluding a single one at the origin, are located in the left half-plane s, and this polynomial is asymptotically stabile, when the following condition holds: Proof. Based on the root locus properties [2,18] and expressions (10) and (11), it can be stated, that provided all initial points of polynomial (7) root locus are located in the left half-plane s (excluding the initial point at the origin), the specific number n i of root locus branches (n i = i À 2 when i is even and n i = i À 1 when i is uneven), initiating at these points, cross the stability bound iω striving along the asymptotes directed to the right half-plane. As the rest of the root locus branches does not cross the stability bound, they are completely stable. For positive branches, crossing the stability bound, specify the set of intervals S il of values a i within the segments from the initial point p il (where a i = 0) of every branch up to its cross point with axis iω. Thus, the maximal possible interval of a i values, ensuring stability of (6), is equal to that proofs the statement being considered. For the 4-th degree polynomial represented in Figure 2, the interval S imax ¼ 0; a 4 t ð Þ ð Þ . Theorem 1. For ensuring asymptotic stability of regular or interval polynomial (1), it is enough to.
a. find among polynomials of extension (6), the stable polynomial of degree i = k being the closest one to n; b.set up sequentially every coefficient a j of (1), beginning with a j = a k + 1, within interval (k + 1) < j ≤ n by setting up the free term a i of the corresponding i-th polynomial of extension (5) as per condition (13) assuming i = j.
Proof. If polynomial g i (s) = g k (s) is stable, then on the basis of Consequence 2 of Statement 1 (expressions (10) and (11)), the stability of g i+1 (s) can be ensured by simple application of condition (13). Thus, stability of all polynomials g i (s) is sequentially ensured beginning with the polynomial of degree i = k + 1 up to the polynomial of degree i = n inclusive, that is, for i ¼ k þ 1 ð Þ, n. Thus, Theorem 1 has been proved.
An algorithm for the robustly stable regular or interval polynomial synthesis is given below.
Step 1. Composing the extension E n (6) of the given initial nominal polynomial g n (s) (1).
Step 2. Sequential check for stability of the extension polynomials, beginning with the polynomial of degree n, until finding the stable polynomial of degree i = k.
In case of synthesis of the whole interval polynomial, begin the procedure with the 1-st degree polynomial, i = k = 1, specifying interval of a 1 according to the appropriate requirements or arbitrarily.
Step 3. Transfer to the polynomial of the next higher degree, i = k + 1.
Step 4. Calculating coordinates ω þ i l of cross points of the polynomial g i (s) free root locus positive branches with the axis iω by solving its appropriate root locus Eq. (3).
Cross points ω þ i l generate on the axis iω a so-called "crossing domain" W þ i : Properties of this domain and behavior of the interval root locus portrait at the stability bound iω have been investigated in [18]. On the basis of the fact, that every function of (3) represents continuous differentiable function (steadily increasing/ decreasing function), it has been found in [18] that for ensuring stability of the whole interval family, it is required to calculate the parameter a i ¼ a þ i l (13) values at only two extreme "dominating points": by solving the corresponding Eq. (3) after substituting preliminarily into this equation, the appropriate combination [18] of the limit values of each coefficient, from a 1 to a iÀ1 , which have been calculated already in this algorithm when generating the originative polynomial g iÀ1 (s). For finding two coordinates (17), two different combinations of coefficients should be substituted into the root locus equation and thus two different equations should be solved.
Step 5. Determining the value of infA þ i (12) for polynomial g i (s) by calculating minimal values a 0 ¼ a 00 i min ω þ i min À Á and a 00 ¼ a þ i min ω þ i max À Á of coefficient a i correspondingly at points ω þ i min and ω þ i max solving twice Eq. (4) for polynomial g i (s) at the stability bound: after substituting previously into (18) the corresponding combinations of coefficients (from a 1 to a iÀ1 ) [18]. Thus, where a i is the upper limit of a i variation interval. The required interval (13) is: 0 < a i < a i : Step 6. If the last polynomial of extension (6), that is, that of degree n, has been already processed (i = n), the calculation is considered finished. Otherwise proceed to step 3.
Step 1. Compose the extended polynomial (6) for (20): Step 2. As coefficients of polynomials (21.1) and (21.2) are positive, then both families of these polynomials are asymptotically stable (i = k = 2), and therefore, on the basis of Consequence 2 of Statement 1, the root loci family of (21.3) initial points is located in the left half-pane. Thus, for making stable, the polynomial (21.3) uses Statement 2 and Theorem 1.
Step 3. Transfer to the polynomial of the next higher degree, i = 2 + 1 = 3.
Step 4. Calculating coordinates (16) of the "dominating points" for polynomial g 3 (s). For this purpose, consider the appropriate root locus (3) and parameter (18) equations: and parameter function (18) at the stability bound: Find the 1-st order derivative of (23) and equate it zero: On the basis of (23) and (24), it can be stated that the character of parameter (23) distribution along the axis σ is steadily increasing and the single extreme point is located at the origin. Thus, there exists the only one extreme point: where function (23) gets the minimal value of the set A þ 3 (see Eq. (12)).

Crossing region of the polynomial root locus portrait
Functions (29) and (30) imply properties of analyticity and continuity and, thus, the points where axis iω is crossed by the branches of the root locus family P (5), given the condition.
constitute on the stability boundary, axis iω, a specific crossing region, D P ω . Definition 8. The region at the asymptotic stability boundary iω of the interval system root locus portrait P, described by characteristic polynomial (26), where the given portrait parameter function (30) values family is located, name the crossing region D P ω of the root locus portrait P. The region D P ω is a continuous one and, thus, each root locus field F k (5) and each branch b ki , i ¼ 1, 2, … of the field root loci generate specific subregions, correspondingly subregion D F ω k and continuous subregion D b ω i, within the above specified region D P ω . Over the symmetry of the portrait hereinafter, the only upper half-plane s is considered.

Majorant and minorant of the extremum region
Obtain the extremum parameter function values within D F ω k ⊂ D P ω . To do so, it is necessary to carry out investigation of this function for extremum. It is evident that the majorant parameter function (majorant) can be obtained through rewriting Eq. (30): Take the first-order derivative of (32) and set it to zero: Investigation and Synthesis of Robust Polynomials in Uncertainty on the Basis of the Root Locus… DOI: http://dx.doi.org/10.5772/intechopen.83705 After solving Eq. (33), obtain three points of extremum for the majorant parameter function for the field when a 2 ¼ a 2 : Rewrite (30) for determination of a minorant parameter function (or a minorant): In the same way obtain three points of extremum for the minorant, when a 2 ¼ a 2 : Definition 9. Extremum region D e ω of the interval system root locus portrait described by the characteristic polynomial (26) is a region [0, ω emax ] at the system asymptotic stability boundary iω where the given portrait parameter function (30) extremum values, a 4emax (34) and a 4emin (36), family is located provided all coefficients а j vary within limits (31). Figure 3 represents the character (diagram) of the parameter function (30) distribution along the boundary of stability by its majorant (32) and minorant (35). For better understanding and descriptiveness, the diagram in Figure 3 is shown by strait lines, although it constitutes curves. Region D P ω constitutes three subregions (see Figure 3): • D ω + where the parameter function is getting increased (increase region);

Diagram of the parameter function distribution along the stability boundary
• Dω À where the parameter function is getting decreased (decrease region); • Dω с where increase and decrease regions combine (mixed region).
Analyze the region Z ω with the interval z 0 ; z 00 Â Ã ⊆ Z ω where the initial points of the root locus portrait migrate through the stability boundary to the right halfplane. In the diagram, zero points z', z" are mapped by points z 1 , z 2 .
Within interval [0, z'], covering completely region D ω + and partly region D ω , only the positive branches cross the stability boundary, and here the whole family Z of initial points is located in the left half-plane L, But specific pieces of the positive branches are situated within the right half-plane. For this reason, in some cases, the unstable polynomials could have been found within the whole family (26). However, there certainly could always be found the intervals (27) of stability where the whole family is stable. Name the interval [0, z'] the system stability region.
The interval [z', z"] covers some piece of the region D ω с and some of the region In this case, axis iω is crossed by combination of both positive and negative branches, and the root locus portrait certainly includes a series of initial points, and thus the whole branches, that have migrated over the boundary to the right half-plane. Therefore, this case always gives us the family (26) that includes combination of stable and unstable polynomials. Name the interval [z', z"] the system instability region. If the interval [z", ∞] completely belongs to the region D ω À , only the negative branches cross the stability boundary iω, and the family Z together with the corresponding positive branches are located in the right half-pane, No stable polynomial could be found in (26). This region name the system complete instability region.

Real crossing region of the portrait
Specify the region D R ω where the branches of the given real root locus portrait cross the stability boundary. To find its limits, consider Eq. (29) and determine the values of its roots. When ω>0.
where ω max , ω min represent the real crossing region. Definition 10. The region [ω min ,ω max ] at the stability boundary iω, where the polynomial (26) root locus portrait branches migrate through to the right half-plane, name the real crossing region D R ω of the system root locus portrait: 13 Investigation and Synthesis of Robust Polynomials in Uncertainty on the Basis of the Root Locus… DOI: http://dx.doi.org/10.5772/intechopen.83705

Graphic-analytical stability conditions for interval polynomials
Define below three possible ways of the real crossing region location and the corresponding stability conditions.

Real crossing region belongs to the increase region D ω
In this case ω max < ω e min . Statement 3. When the dynamic system root locus portrait, described by polynomial (26), satisfies relationship (42), the whole family Z of the portrait initial points is located in the left half-plane L, Then, define the set S of the root locus portrait Р branches' intervals s i : a 4 (ω i ) represents the parameter function (30) at points with the coordinates ω i ; S ⊂ Р and S ⊂ L (40). Thus, from (42) and (43) obtain: where a 4 ω min ð Þ-function (30) minimal value at point ω min (40). Hence, The following statement can be formulated on the basis of expressions (42) and (47). Statement 4. The dynamic system, described by the interval characteristic polynomial family (26) and satisfying expression (42), is asymptotically stable if a 4 < a 4 ω min ð Þ: Definition 11. One or more stable polynomials with constant coefficients within the family (26) that guarantee stability of the whole family name the dominating polynomials.
From Statement 4 and the previous conclusions, the following stability condition goes.
Stability condition 1. The asymptotic stability of the interval system family, described by the root locus portrait Р (5) satisfying expression (42), is guaranteed if polynomial of the family is stable. Polynomial (49) represents the dominating one. Stability is verified using the Stability condition 1. The polynomial parameters are calculated with application of the Statement 4.

Real crossing region belongs to the decrease region D
It happens in case if ω min ≥ ω e max . The above made conclusions allow to formulate the following statement. Statement 5. If the interval system root locus portrait P satisfies condition (50), the whole family Z of its initial points satisfies Eq. (39), and the system is asymptotically unstable.

Real crossing region completely or partially belongs to the mixed region D
We have this when the following conditions are not satisfied: ω max < ω e min , ω min ≥ ω emax .
For this case We have already discussed the increase part of (52), when P À = ∅. Hence, this section considers the decrease part, P À . Consider first the family Z of the root locus portrait P À . Statement 6. If condition (51) holds, family Z of initial points of the dynamic system root locus portrait, described by characteristic polynomial (26), can be located in both left half-plane L and right half-plane R, that is, the following options of Z location may take place: Evidently, options (54) and (55) take place when As options (54)-(57) deliberately indicate instability of the system in whole, consider below only option (53) of the system poles location, where ω(z 0 ) is coordinate ω at point z 0 (Figure 3).
In this case proceed just as in (44)-(47) but only substituting ω max instead of ω min . Statement 7. The asymptotic stability of the dynamic system, described by polynomial family (26) and satisfying expression (51), is ensured when the following condition holds: From condition (59) follows that the system asymptotic stability for part Р À of portrait (52), provided that condition (53) holds, is defined by the value of a 4 ω max ð Þ. Therefore, for checking stability of Р À (52), it is enough to check the only one following dominating polynomial of (26): s 4 þ a 1 s 3 þ a 2 s 2 þ a 3 s þ a 4 ¼ 0: (60) Because in this case, the portrait represents the compound one (52), check the stability by checking both polynomials, (49) and (60).
Stability condition 2. If the interval dynamic system root locus portrait Р (52), describing the family of characteristic polynomials (26), satisfies expression (51), the system asymptotic stability is ensured when the following dominating polynomials To determine the coefficients of (26), ensuring satisfaction of expressions (53) and (58), Eqs. (30) and (31) are applied. Thus, coefficients а 1 and а 3 must satisfy the inequality:  Polynomial stability could be estimated graphically directly from the plots (see Figures 3 and 4).
Real region: D R ω : ω min = 2; ω max = 7,1; a 4 ω min ð Þ= 64; a 4 ω max ð Þ= À 1532,97. [z', z"]: ω(z') = 4,47; ω(z") = 8,37. In Figure 4, the above indicated regions are shown. The points, corresponding to the dominating polynomials (61), (62), are designated by r' and r". The real crossing region in this case completely covers the extremum region, It is evident that the given polynomial family in whole is unstable. Within region Z ω = [z', z"], there exist poles that have migrated to the right half-plane (see (54)), which is confirmed by the negative value of the parameter a 4 ω max ð ÞI. Dominating polynomials of the family are the following: Polynomials stability check shows that polynomial (6), which root loci crosses the stability boundary at point a 4 ω min ð Þ, is stable, and polynomial (66), which root loci crosses the stability boundary at point a 4 ω max ð Þ, has two roots with positive real parts.
Extraction of the stable polynomial subfamily of the given unstable family: The stable root locus family, satisfying conditions (58) and (59), should cross the stability boundary within the region bounded by interval [r', z'] as in this case all initial points of the root locus family are located in the left half-plane (53) (see Section 5.5).

Conclusions and future developments
A method has been worked out for synthesis of asymptotically stable regular or interval polynomial from the given Hurwitz or non-Hurwitz source polynomial with constant/interval coefficients by setting up coefficients of the given one. The root locus approach is used. The task is solved by introduction of notions of the "extended polynomial" ("generalized polynomial") and the polynomial "extended root locus," which allows to obtain a descriptive picture of the polynomial root dynamics under coefficient variations and to disclose on this basis the cause of instability. The intervals of uncertainty for each coefficient being set up are specified along the root locus branches.
The above described method based on the "extended root locus" notion is new and allows to extend the application sphere of the root locus method, which is traditionally considered to be the method of system synthesis by only a single parameter (coefficient) variation and with only one variable parameter (coefficient), in both directions: system synthesis by many parameter variations and system synthesis with many parameter variations.
Investigation of the fourth power dynamic system behavior in conditions of the interval parameter variations has also been carried out on the basis of root locus portraits and introduction of the notion of the "diagram of the root locus parameter function values distribution along the stability bound." Behavior regularities for interval system root locus portraits at the stability boundary have been formulated. On this basis, the stability conditions have been derived, and graphic-analytical method has been worked out for calculating intervals of parameter variation ensuring the system robust stability.
In continuation of the results of Anderson [22] and Kharitonov [4] in this work, it is proved that for the 4th power interval system family asymptotic stability analysis, it is enough to use the only one polynomial of this kind. It is also shown, how to find and extract the stable families from the unstable ones.
The above discussed topic is certainly worth further investigation in the light of continuous progress of both theory and technology. When speaking of the practical implementations, it could be noted that most of the control system synthesis tasks, especially those in the area of robust control, are currently still being solved in a somewhat "local domestic" way, when a designer each time tries to invent a solution to be suitable for the specific application experiencing the lack of more generalized methods. Besides this, a great deal of existing robust control methods share and suffer complexity. In this connection, further in-depth investigation of the uncertain polynomials' root locus portraits seems helpful, especially the analysis of its composition in terms of configurations variety, constituting subfamilies, placement of various root domains within the prescribed regions in the complex plane and, of course, dynamics. They also could be distinguished for their undoubted descriptiveness.
Polynomial equation approach in the design technique [16], and root locus technique in particular, is descriptive, clear, and easy to use and computerize and thus could be helpful in many application areas including the areas of industry, biology, medicine, etc. It can be used for proper parameterization of robust drive controllers, for example, in the area of railway traffic control, in particular for the cases of tackling the problems of breaking and skidding.

Author details
Nesenchuk Alla United Institute of Informatics Problems of the Belarusian National Academy of Sciences, Minsk, Belarus *Address all correspondence to: anes@newman.bas-net.by © 2019 The Author(s). Licensee IntechOpen. This chapter is distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/ by/3.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.