Journal of Applied Mathematics

Volume 2012 (2012), Article ID 840603, 32 pages

doi:10.1155/2012/840603

Research Article

Interval Continuous Plant Identification from Value Sets

R. Hernández,¹ J. A. García,² and C. Mañoso¹

¹Departamento de Sistemas de Comunicación y Control, UNED, c/Juan del Rosal 16, 28040 Madrid, Spain

²Departamento de Tecnología de Computadores y Comunicaciones, Universidad de Extremadura, 06800 Madrid, Spain

Received 13 April 2012; Revised 1 September 2012; Accepted 1 September 2012

Academic Editor: Zhiwei Gao

Copyright © 2012 R. Hernández et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

This paper shows how to obtain the values of the numerator and denominator Kharitonov polynomials of an interval plant from its value set at a given frequency. Moreover, it is proven that given a value set, all the assigned polynomials of the vertices can be determined if and only if there is a complete edge or a complete arc lying on a quadrant. This algorithm is nonconservative in the sense that if the value-set boundary of an interval plant is exactly known, and particularly its vertices, then the Kharitonov rectangles are exactly those used to obtain these value sets.

1. Introduction

In reference to the identification problem, these have been widely motivated and analysed over recent years [1]. Van Overschee and De Moor in [2] explains a subspace identification algorithm. In [3] the authors present a robust identification procedure for a priori classes of models in ; the authors consider casual, linear time invariant, stable, both continuous or discrete time models, and only SISO systems.

Interval plants have been widely motivated and analysed over recent years. For further engineering motivation, among the numerous papers and books, [4–9] must be pointed out and the references thereof.

The identification problem using the interval plant framework, that is, to compute an interval plant from the frequency response, has not been completely solved. Interval plant identification was investigated by Bhattacharyya et al. [5], who developed a method in which identification is carried out for interval plants so that the numerator and denominator have the same degree, starting from the variation of the coefficient values of a nominal transfer function at certain intervals. So, the identification of a nominal transfer function is carried out first, and then the intervals of variation of the coefficients are determined.

A different approach was developed by Hernández et al. [10] studying the problem from the extreme point results point of view. This was a first step for the identification of an interval plant, showing three main properties to characterize the value set lying on a quadrant. Then an algorithm for the identification of interval plants from the vertices of the value sets is obtained. However, this algorithm solves the identification problem when the value set contains at least five vertices in a quadrant.

This paper improves the results obtained in [10] and shows how to obtain the values of the numerator and denominator Kharitonov polynomials when the value sets have less than five vertices in the same quadrant. Identification with such an interval plant allows engineers predict the worst case performance and stability margins using the results on interval systems, particularly extreme point results.

2. Problem Statement

Let us consider a linear interval plant of real coefficients, of the form

where and are interval polynomials given as

with ,,, and where vectors , and are the uncertainty parameters that lie in the hyperrectangles and , respectively.

Numerator and denominator polynomial families are characterized by their respective Kharitonov polynomials, and they can be expressed in terms of their even and odd parts, at , as follows:

Family :

where

Family :

where

As is well known, the values of the complex plane obtained for the transfer function at a given frequency are denominated as a value set. The identification of the system consists in determining the transfer function coefficients from the value set.

As can be observed in [10], when the values and are known, then the system of equations given in [10, equation 14] can be solved and therefore the interval plant is identified (see [10] for details).

As is shown [10] the vertices of the value-set boundary of an interval plant can be assigned as

where and are the assigned polynomials numerator and denominator, respectively. When they are in the same quadrant they are a Sorted Set of Vertices (SSV).

As is well known, the Kharitonov polynomials values can be obtained from

It must be pointed out that the results presented in [10] must be considered as the background necessary for this work. Thus, the geometry of the value set is described in [10] and the concepts necessary for its description are defined, (such as the successor, predecessor element, etc.) and the fundamental properties on which this work is based are proven.

This paper is organized as follows. Section 3 shows how to determine the assigned polynomial with the only condition that there is a complete segment in a quadrant. Similarly Section 4 shows it when there is an arc in a quadrant. Section 5 illustrates the algorithm and examples. Finally, the conclusions are shown in Section 6.

3. Assigned Polynomial Determination When There Is a Complete Segment in a Quadrant

In order to determine the polynomials numerator and denominator associated to a vertex of the value set boundary with the minimum number of elements, the situation of a segment in a quadrant will be considered. So, let be a segment of the value-set boundary with vertices and . Continuity segment-arc in a quadrant (see [10, Theorem 2]) implies that there will be a successor arc with vertices , counter-clockwise and a predecessor arc with vertices counter-clockwise. When these arcs are completed the denominators are vertices of the Kharitonov rectangle. Figures 1 and 2 show this situation.

Figure 1: egment and complete arcs.

Figure 2: Segment and no complete arcs.

As was shown, the values of ,, and can be calculated from the complete segment based on a normalization (see [10, Theorem 4]). The following normalization simplifies the nomenclature.

Lemma 3.1 (segment normalization). Let be a complete segment of the value-set boundary with vertices and and the normalization , where being the argument of the segment . Then ,,, and , where () is any point of the next (previous) arc of the segment .

Proof. It is trivial. This normalization is one of the infinite possible solutions [10] for a value set. This normalization implies fitting with modulus and angle so that the segment of the Kharitonov polynomial numerator with vertices and will be parallel to the real axis counter-clockwise. Thus, from the information with a complete segment in a quadrant the values of ,,,, and can be calculated.

This paper deals with the general case where ,,, and .

Given a vertex in a quadrant, the target is to determine the polynomials and . The vertex belongs to a part of a segment and a part of an arc, due to the continuity segment-arc in a quadrant. So, will be the vertex of two elements, arc-segment (Figure 3) or segment-arc (Figure 4).

Figure 3: vertex of two elements, arc-segment.

Figure 4: vertex of two elements, segment-arc.

The following Lemma shows the necessary conditions on the denominator to be a solution of .

Lemma 3.2 (denominator condition). Let be a complete segment in a quadrant and let be the denominator of a vertex in a quadrant. Then it is a necessary condition that satisfies one of the following conditions:

(1) and or or or ,(2) and or or or ,(3) and or or or ,(4) and or or or ,

where is the real part of and is the imaginary part of , and the corresponding assigned denominator is shown between brackets.

Proof. The proof is obtained directly from the information of a complete segment in a quadrant and the properties of the Kharitonov rectangle. So, from the complete segment and the normalization (Lemma 3.1), the values of ,, and are known. Then, can be established as ,, , or .

If then is . Given a value , it will be a vertex of the Kharitonov rectangle denominator only if ( is ) or ( is ) or ( is ) or ( is ). (Figures 5(a), 5(b), 5(c), and 5(d)).  Note that if any of these conditions is not satisfied, then cannot be a solution. For example, if , does not belong to the rectangle with vertex , , and are elements of the successor and predecessor edges. Figure 6 shows these considerations. Similarly, if then is . Given a value , it will be a vertex of the Kharitonov rectangle denominator only if ( is ) or ( is ) or ( is ) or ( is ). If then is . Given a value , it will be a vertex of the Kharitonov rectangle denominator only if ( is ) or ( is ) or ( is ) or ( is ). Finally, if then is . Given a value , it will be a vertex of the Kharitonov rectangle denominator only if ( is ) or ( is ) or ( is ) or ( is ).

(a)

(b)

(c)

(d)

Figure 5: Cases where is a vertex of the kharitonov rectangle denominator.

Figure 6: Cases where is not a vertex of the kharitonov rectangle denominator.

On the other hand, the behaviour of a segment on the complex plane when divided by a complex number is well known. The following property shows this behaviour.

Property 1. Let be a segment on the complex plane with vertices and counter-clockwise where is a segment with vertices and counter-clockwise. Let be a complex number with argument . Let be . Then the relation between the argument of and , is given by

(1) if and only if ,(2) if and only if ,(3) if and only if ,(4) if and only if .

The following Theorem shows how to characterize and calculate the polynomials and associated with a vertex from the information of the boundary with a segment in a quadrant, belonging to a segment-arc.

Theorem 3.3 (predecessor). Let be a complete segment of the value-set boundary with vertices and , the successor arc with vertices , counter-clockwise, and the predecessor arc with vertices , counter-clockwise. Let be a segment with vertices and counter-clockwise, where belongs to the intersection of and an arc of the boundary (Figure 7). Then

(1) (condition C1) and the denominator of defined by satisfies the denominator condition (Lemma 3.2), if and only if and cannot be any other assigned polynomial,(2)when , (condition C2) and the denominator of defined by satisfies the denominator condition (Lemma 3.2) if and only if and cannot be any other assigned polynomial,(3)when and , (condition C3), and the denominator of defined by satisfies the denominator condition (Lemma 3.2) if and only if and cannot be any other assigned polynomial,(4)when , , and , (condition C4), and the denominator of defined by satisfies the denominator condition (Lemma 3.2) if and only if .

Figure 7: Vertices for the conditions of the Theorem 3.3.

Proof. From the complete segment using the normalization (Lemma 3.1) the values of ,,,, and are known. Obviously the value is known.

If the value of can be calculated and the denominator condition (Lemma 3.2) is satisfied. On the other hand, the quotient of the vertices and is , and . , where is part of the segment with vertices and , then (normalization). Thus (Property 1) and ; Theorem 3.3(C1) is satisfied.

In order to demonstrate the “only if” part, it must be proven that if Theorem 3.3(C1) and the denominator condition are satisfied then the solution , is unique. It must be noted that Theorem 3.3(C1) can be satisfied when (a) , (b) or (c) and in all the cases, the value of determined, verify the denominator condition.

Let be the denominator of determined by , verifying Theorem 3.3(C1), and denominator condition, and let where is part of the segment with vertices and , .

Let be the denominator of determined by . Then where is part of the segment with vertices and , (normalization) and using Property 1  . As is the same vertex, then , and . verify Theorem 3.3(C1), because

Let with . Then and (by normalization ). Thus . Moreover , and if then . As and , then and they have equal real and imaginary parts.

then

Thus

then

Thus .

Taking into account both conditions, . This relation is impossible. Therefore, if is a solution then is not, and is not a solution.

Let be the denominator of determined by . Then where is part of the segment with vertices and , (normalization) and using Property 1  . As is the same vertex, then and . verify Theorem 3.3(C1), because

In this case the demonstration is trivial noting that . This is not possible because the Kharitonov polynomial denominator cannot contain the zero.

Let be the denominator of determined by . Then where is part of the segment with vertices and , (normalization) and using Property 1  . As is the same vertex, then , and . verify Theorem 3.3(C1), because

Let with . Then and (by normalization ). Thus . Moreover , and if then . As and , then and they have equals real and imaginary parts.

then

Thus .

then

Thus .

Taking into account both conditions, . This relation is impossible. Therefore, if is a solution, is not and cannot be a solution.

If the value of can be calculated and the denominator condition (Lemma 3.2) is satisfied. On the other hand, the quotient of the vertices and is , and . where is part of the segment with vertices and , then (normalization). Thus (Property 1) and ; Theorem 3.3(C2)is satisfied.

In order to demonstrate the “only if” part, it must be proven that if Theorem 3.3(C2) and the denominator condition are satisfied then the solution , is unique. It must be noted that Theorem 3.3(C2) can be satisfied when (a) or (b) and in all the cases, the value of determined, verify the denominator condition.

Let be the denominator of determined by , verifying Theorem 3.3(C2), and denominator condition, and let where is part of the segment with vertices and , .

Let be the denominator of determined by . Then where is part of the segment with vertices and , (normalization) and using Property 1   . As is the same vertex, then and . verify Theorem 3.3(C2), because

In this case the demonstration is trivial noting that . This is not possible because the Kharitonov polynomial denominator cannot contain the zero.

Let be the denominator determined by . Then where is part of the segment with vertices and , (normalization) and using Property 1. As is the same vertex, then , and . verify Theorem 3.3(C2), because

Let with . Then and (by normalization ). Thus . Moreover , and if then . How and , then and they have equals real and imaginary parts.

Thus .

and finally .

Taking into account both conditions, . This relation is impossible. Therefore, if is a solution, is not and is not a solution.

If then cannot be directly calculated because is not known. First, Theorem 3.3(C3) is developed. If then where is part of the segment with vertices and and . Thus (Property 1) and .

As , then . On the other hand, is greater than because it is counter-clockwise. Therefore (Theorem 3.3(C3)) is satisfied and can be calculated by the expression .

In order to demonstrate the “only if” part, it must be proven that if Theorem 3.3(C3) and the denominator condition are satisfied then the solution , is unique. If and , it must be noted that Theorem 3.3(C3) can be satisfied when .

Let be the denominator of determined by verifying Theorem 3.3(C3) and denominator condition. where is part of the segment with vertices and , .

Let be the denominator of determined by . Then where is part of the segment with vertices and , (normalization) and using Property 1   . Thus .

As is the same vertex, , and then . Let , then , and because verifies (by normalization), Theorem 3.3(C3) is satisfied.

. If then . As and , then and they have equal real and imaginary parts.

and finally .

and finally .

Taking into account both conditions, . This relation is impossible. Therefore, if is a solution, is not, and is not a solution.

If then cannot be directly calculated because is not known. First, Theorem 3.3(C4) is developed.

If then where is part of the segment with vertices and verifying that . Thus (Property 1) and . Moreover, . Then . On the other hand, is greater than because it is counter-clockwise.

Therefore the condition Theorem 3.3(C4) is satisfied and can be calculated using the expression .

If , and it is .

Remark 3.4. This theorem is used in the example of Section 5, for the value set III (frequency ) in order to assign the second and fifth vertices.

The following Theorem is analogous to Theorem 3.3 when is a segment with vertices and counter-clockwise, and belonging to an arc-segment.

Theorem 3.5 (successor). Let be a complete segment of the value-set boundary with vertices and , the successor arc to , with vertices , counter-clockwise, and the predecessor arc to with vertices , counter-clockwise. Let be a boundary segment with vertices and counter-clockwise, where belongs to the intersection of an arc of the boundary and . Then

(1) (condition C1) and the denominator of defined by satisfies the denominator condition (Lemma 3.2), if and only if and cannot be any other assigned polynomial,(2)when , (condition C2) and the denominator of of defined by satisfies the denominator condition (Lemma 3.2) if and only if and cannot be any other assigned polynomial,(3)when and , (condition C3), and the denominator of defined by satisfies the denominator condition (Lemma 3.2) if and only if and cannot be any other assigned polynomial,(4)when , , and , (condition C4), and the denominator of defined by satisfies the denominator condition (Lemma 3.2) if and only if .

Proof. Analogous to Theorem 3.3.

Remark 3.6. This theorem is used in the example of Section 5, for the value set III (frequency ) in order to assign the third, fifth, and sixth vertices.

4. Assigned Polynomial Determination When There Is a Complete Arc in a Quadrant

In order to determine the polynomials numerator and denominator associated to a vertex of the value set boundary with the minimum number of elements, the situation of an arc in a quadrant will be considered. So, let be an arc of the value-set boundary with vertices and . A continuity arc-segment in a quadrant (see [10, Theorem 2]) implies that there will be a successor segment with vertices , counter-clockwise and a predecessor segment with vertices and counter-clockwise.

When these segments are completed the denominators are vertices of the Kharitonov rectangle. Figure 8 shows this situation.

Figure 8: Arc and two complete segments.

As was shown, the values of ,  , and can be calculated from the complete arc based on a normalization (see [10, Theorem 5]). The following normalization simplifies the nomenclature.

Lemma 4.1 (arc normalization). Let be a complete arc of the value-set boundary with vertices and , the normalization , where , being the argument of the segment . Then , , , and , where () is any point of the next (previous) segment of the arc .

Proof. It is trivial. This normalization is one of the infinite possible solutions for a value set. This normalization implies fitting with modulus and angle so that the segment of the Kharitonov polynomial denominator with vertices and will be parallel to the real axis counter-clockwise. Thus, from the information with a complete arc in a quadrant the values of , , , , and can be calculated.

This paper deals with the general case where , , , and .

Given a vertex in a quadrant, the target is to determine the polynomials and . The vertex belongs to a part of an arc and a part of a segment, due to the continuity arc-segment in a quadrant. So, will be the vertex of two elements, segment-arc (Figure 9(a)) or arc-segment (Figure 9(b)).

(a)

(b)

Figure 9: (a) vertex of two elements, segment-arc. (b) vertex of two elements, arc-segment.

The following Lemma shows the necessary conditions on the denominator to be a solution of .

Lemma 4.2 (numerator condition). Let be a complete arc in a quadrant and let be the numerator of a vertex in a quadrant. Then it is a necessary condition that satisfies one of the following conditions:

(1) and or or or ,(2) and or or or ,(3) and or or or ,(4) and or or or ,

where is the real part of and is the imaginary part of , and the corresponding assigned numerator is shown between brackets.

Proof. The proof is obtained directly from the information of a complete arc in a quadrant and the properties of the Kharitonov rectangle. So, from the complete arc and the normalization (Lemma 3.2), the values of , , and are known. Then, can be established as , , , or .

(1)If then is . Given a value , it will be a vertex of the Kharitonov rectangle numerator only if ( is ) or ( is ) or ( is ) or ( is ). Note that if any of these conditions is not satisfied, then cannot be a solution. For example, if , does not belong to the rectangle with vertex , , and are elements of the successor and predecessor edge.(2)Similarly, if then is . Given a value , it will be a vertex of the Kharitonov rectangle numerator only if ( is ) or ( is ) or ( is ) or ( is ).(3)If then is . Given a value , it will be a vertex of the Kharitonov rectangle numerator only if ( is ) or ( is ) or ( is ) or ( is ). (4)Finally, if then is . Given a value , it will be a vertex of the Kharitonov rectangle numerator only if ( is ) or ( is ) or ( is ) or ( is ).

On the other hand, the behaviour of an arc on the complex plane when it is divided by a complex number is well known. The following property shows this behaviour.

Property 2. Let be an arc on the complex plane with vertices and counter-clockwise where is a segment with vertices and counter-clockwise. Let be a complex number with argument . Let be . Then the relation between the argument of and , is given by

(1) if and only if ,(2) if and only if ,(3) if and only if ,(4) if and only if .

The following Theorem shows how to characterize and calculate the polynomials and associated with a vertex from the information of the boundary with an arc in a quadrant, belonging to an arc-segment.

Theorem 4.3 (predecessor). Let be an arc of the value-set boundary with vertices and , the successor segment with vertices , counter-clockwise, and the predecessor segment with vertices , counter-clockwise Let be an arc with vertices and counter-clockwise. Then

(1) (condition C1) and satisfies the numerator condition, where , if and only if and cannot be any other assigned polynomial,(2)when , (condition C2) and satisfies the numerator condition if and only if and cannot be any other assigned polynomial,(3)when and , (condition C3), and satisfies the numerator condition if and only if and cannot be any other assigned polynomial,(4)when ,, and , (condition C4), and satisfies the numerator condition if and only if .

Proof. Analogous to Theorem 3.3.

Remark 4.4. This theorem is used in the example of Section 5, for the value set I (frequency ) in order to assign the fifth and seventh vertices, and for the value set II (frequency ) to assign the third, fifth, and seventh vertices.

The following theorem is analogous to Theorem 4.3 when is an arc with vertices and counter-clockwise, and belonging to a segment-arc.

Theorem 4.5 (successor). Let be a complete arc of the value-set boundary with vertices and , the successor segment with vertices , counter-clockwise and the predecessor segment with vertices , counter-clockwise. Let be an arc with vertices and counter-clockwise

Then

(1) (condition C1) and satisfies the numerator condition, where , if and only if and cannot be any other assigned polynomial,(2)when , (condition C2) and satisfies the numerator condition if and only if and cannot be any other assigned polynomial,(3)when and , (condition C3), and satisfies the numerator condition if and only if and cannot be any other assigned polynomial,(4)when , , and , (condition C4), and satisfies the numerator condition if and only if .

Proof. Analogous to Theorem 3.3.

Remark 4.6. This theorem is used in the example of Section 5, for the value set I (frequency ) in order to assign the third, fourth, and sixth vertices, and for the value set II (frequency ) to assign the fourth and sixth vertices.

Finally, the following theorem points out the necessary and sufficient condition.

Theorem 4.7. Given a value set, all the assigned polynomials of the vertices can be determined if and only if there is a complete edge or a complete arc lying on a quadrant when the normalized edge satisfies ,,, and or the normalized arc satisfies ,,, and .

Proof. It is obvious from Theorems 3.3–4.5.

5. Algorithm and Examples

Algorithm 5.1. Given a value set with a complete segment or a complete arc in a quadrant, to obtain the Kharitonov polynomials the following.

(1)If there is a complete segment in a quadrant, , with vertices and , the successor arc with vertices , counter-clockwise and the predecessor arc with vertices , counter-clockwise then for all vertex :

(a)if is a vertex intersection of a segment and an arc counter-clockwise, then the assigned polynomials numerator and denominator, and , determine applying Theorem 3.3,(b)if is a vertex intersection of an arc and a segment counter-clockwise, then the assigned polynomials numerator and denominator, and , determine applying Theorem 3.5.

(2)If there is a complete arc in a quadrant, , with vertices and , the successor segment with vertices , counter-clockwise and the predecessor segment with vertices , counter-clockwise, then given a vertex :

(a)if is a vertex intersection of an arc and a segment counter-clockwise, then the assigned polynomials numerator and denominator, and , determine applying Theorem 4.3,(b)if is a vertex intersection of a segment and an arc counter-clockwise, then the assigned polynomials numerator and denominator, and , determine applying Theorem 4.5.

(3)Calculate the values of the assigned polynomials , , solving the equation system (2.7):

(4)Calculate the numerator and denominator rectangles with Kharitonov polynomial values , applying (2.8).

Example 5.2. Figure 10 shows three value sets of an interval plant. The necessary information (Table 1) is

(i)the vertices,(ii)the intersections with the axis,(iii)the shape of the boundary's elements: arc or segment.

Table 1: Value set boundary information.

(a)
(b)
(c)
(a)
(b)
(c)
(a)
(b)
(c)

0

0

1

1

1

0

0

0

0

1

1

1

0

0

0

1

1

1

0

0

0

1

0

1

1

1

0

(a): Vertex () or cut point (blank) with an axis. (b): Value of the vertex or cut point.

(c): Edge (2.1) or arc (0) between this element and the next element. If the element is the last, the next element is the first.

(a)

(b)

(c)

Figure 10: Three value sets of an interval plant.

This example illustrates how to obtain the assigned polynomials and the numerator and denominator rectangles for each value set, and remarks the theorem used in each step.

5.1. Value Set at Frequency

The complete arc with vertices and is taken as initial element. Then Theorems 4.3 and 4.5 will be applied. So

Applying the arc normalization (Lemma 4.1) the following data are obtained

Then, all the other vertices are assigned as follows.

Vertex . Then . These are the vertices of an edge, and Theorem 4.5 is applied, , .

Case 1. Theorem 4.5(C1) is satisfied: and satisfies the Numerator Condition (Lemma 4.2,):

Then . Therefore .

Vertex . Then . These are the vertices of an edge, and Theorem 4.5 is applied: , .

Case 1. Theorem 4.5(C1) is satisfied: and satisfies the Numerator Condition (Lemma 4.2, ). Then . Therefore .

Vertex . Then . These are the vertices of an arc, and Theorem 4.3 is applied: .

Case 1. Theorem 4.3(C1) is not satisfied: .

Case 2. Theorem 4.3(C2) is not satisfied:.

Case 3. Theorem 4.3(C3) is satisfied: and satisfies the Numerator Condition (Lemma 4.2) . Then   .

Vertex . Then . These are the vertices of an edge, and Theorem 4.5 is applied: , .

Case 1. Theorem 4.5(C1) is not satisfied: .

Case 2. Theorem 4.5(C2) is not satisfied: .

Case 3. Theorem 4.5(C3) is satisfied: and satisfies the Numerator Condition (Lemma 4.2(3)) : then and .

Vertex . Then . These are the vertices of an arc, and Theorem 4.3 is applied: .

Case 1. Theorem 4.3(C1) is not satisfied: .

Case 2. Theorem 4.3(C2) is not satisfied: .

Case 3. Theorem 4.3(C3) is not satisfied: .

Case 4. Theorem 4.3(C4) is satisfied: and satisfies the Numerator Condition (Lemma 4.2) . Then ; .

In summary, the assigned polynomials are

and the values can be calculated: from normalization,

and from the vertices,

Then

Table 2 shows the results of the algorithm for the value set at frequency .

Table 2: Results of the algorithm for the value set at frequency .

arc

0.8000 + 10.4000j
−4.8000 + 7.6000j
−3.5862 + 1.0345j
−2.5517 + 0.6207j
−1.3443 + 1.2131j
Kharitonov rectangles calculated

1.5676 + 2.5946j
Theorem

applied
Theorem 4.5
Theorem 4.5
Theorem 4.3
Theorem 4.5
Theorem 4.3

2.0000 + 8.0000j

2.0000 + 8.0000j
10.0000j
−4.8000 + 7.6000j
−3.5862 + 1.0345j
−2.5517 + 0.6207j

0.8000 + 10.4000j

10.0000j
−3.5862 + 1.0345j
−2.5517 + 0.6207j
−1.3443 + 1.2131j
2.3336j

0 + 2.3336j

210.97
174.29
174.29
261.87
261.87

229.40
Condition

verified
Theorem 4.5(C1)
Theorem 4.5(C1)
Theorem 4.3(C3)
Theorem 4.5(C3)
Theorem 4.3(C4)

−0.6508 − 0.7592j

−0.6508 − 1.0846j
0.1084 − 1.0847j
0.1085 − 1.0846j
0.1085 − 0.7592j
0.1085 − 0.7592j

−0.3254 + 0.0542j

−0.1085 + 0.0542j
−0.1085 + 0.0542j
−0.1085 + 0.2712j
−0.1085 + 0.2712j
−0.3254 + 0.2712j

−0.1085 + 0.0542j

−0.1266 − 0.7594j

−0.6508 − 1.0846j

From these Kharitonov rectangles the value set given in Figure 11(a) is directly obtained.

(a)

(b)

(c)

Figure 11

5.2. Value Set at Frequency

The complete arc with vertices and is taken as initial element. Then Theorems 4.3 and 4.5 will be applied. So

Applying the arc normalization (Lemma 4.1) the following data are obtained:

Then, all the other vertices are assigned as follows.

Vertex . Then . These are the vertices of an arc, and Theorem 4.3 is applied: .

Cases 1and2. Theorem 4.3(C1) and (C2) are not satisfied.

Case 3. Theorem 4.3(C3) is satisfied: and satisfies the Numerator Condition (Lemma 4.2) Then .

Vertex . Then . These are the vertices of an edge, and Theorem 4.5 is applied: and .

Cases 1and2. Theorem 4.5(C1) and (C2) are not satisfied.

Case 3. Theorem 4.5(C3) is satisfied: and satisfies the Numerator Condition (Lemma 4.2) . Then .  .

Vertex . Then . These are the vertices of an arc, and Theorem 4.3 is applied: .

Cases 1, 2, and3. Theorem 4.3(C1), (C2), and (C3) are not satisfied.

Case 4. Theorem 4.3(C4) is satisfied: and satisfies the Numerator Condition (Lemma 4.2) . Then   .

Vertex . Then . These are the vertices of an edge, and Theorem 4.5 is applied: , .

Cases 1, 2, and3.  Theorem 4.5(C1), (C2), and (C3) are not satisfied.

Case 4. Theorem 4.5(C4) is satisfied: and satisfies the Numerator Condition (Lemma 4.2) : then , .

Vertex . Then . These are the vertices of an arc, and Theorem 4.3 is applied: .

Case 1. Theorem 4.3(C1) is not satisfied.

Case 2. Theorem 4.3(C2) is satisfied: and satisfies the Numerator Condition (Lemma 4.2) . Then , .

In summary, the assigned polynomials are

and the values can be calculated: from normalization,

and from the vertices,

Then

Table 3 shows the results of the algorithm for the value set at frequency .

Table 3: Results of the algorithm for the value set at frequency .

arc

Kharitonov rectangles calculated

Theorem

applied
Theorem 4.3
Theorem 4.5
Theorem 4.3
Theorem 4.5
Theorem 4.3

8.95
127.23
127.23
210.20
186.88

81.05
Condition

verified
Theorem 4.3(C3)
Theorem 4.5(C3)
Theorem 4.3(C4)
Theorem 4.5(C4)
Theorem 4.3(C2)

From these Kharitonov rectangles the value set given in Figure 11(b) is directly obtained.

5.3. Value Set at Frequency

The complete edge with vertices and is taken as initial element. Then Theorems 3.3 and 3.5 will be applied. So

Applying the edge normalization (Lemma 3.1) the following data are obtained:

Then, all the other vertices are assigned as follows.

Vertex . Then . These are the vertices of an arc, and Theorem 3.5 is applied: and .

Cases 1and 2. Theorem 3.5(C1) and (C2) are not satisfied.

Case 3. Theorem 3.5(C3) is satisfied: and satisfies the Denominator Condition (Lemma 3.2(3)) : then ;  .

Vertex . Then . These are the vertices of an edge, and Theorem 3.3 is applied: .

Cases 1and2. Theorem 3.3(C1) and (C2) are not satisfied.

Case 3. Theorem 3.3(C3) is satisfied: but does not satisfy the Denominator Condition: (Case 3) but then and then then .

Case 4. Theorem 3.3(C4) is satisfied: and satisfies the Denominator Condition (Lemma 3.2) :

Then , .

Vertex . Then . These are the vertices of an arc, and Theorem 3.5 is applied: and .

Cases ,  and 3. Theorems 3.5(C1) and (C2) are not satisfied. Theorem 3.5(C3) is satisfied but does not satisfy the Denominator Condition (Lemma 3.2).

Case 4. Theorem 3.5(C4) is satisfied: and satisfies the Denominator Condition (Lemma 3.2(3)).

Then , .

Vertex . Then . These are the vertices of an arc, and Theorem 3.5 is applied: and .

Cases 1, 2, and 3. Theorem 3.5(C1) and (C2) are not satisfied. Theorem 3.5(C3) is satisfied but does not satisfy the Denominator Condition (Lemma 3.2(3)).

Case 4. Theorem 3.5(C4) is satisfied: and satisfies the Denominator Condition (Lemma 3.2(3)) .

Then , .

Vertex . Then . These are the vertices of an edge, and Theorem 3.3 is applied: .

Case 1. Theorem 3.3(C1) is not satisfied.

Case 2. Theorem 3.3(C2) is satisfied: and satisfies the Denominator Condition (Lemma 3.2(3)) . Then , .

In summary, the assigned polynomials are

and the values can be calculated: from normalization,

and from the vertices,

Then

Table 4 shows the results of the algorithm for the value set at frequeny .

Table 4: Results of the algorithm for the value set at frequency .

edge

Kharitonov rectangles calculated

Theorem

applied
Theorem 3.5
Theorem 3.3
Theorem 3.5
Theorem 3.5
Theorem 3.3

308.66
308.66
23.01
352.12
352.12

284.62
Condition

verified
Theorem 3.5(C3)
Theorem 3.3(C4)
Theorem 3.5(C4)
Theorem 3.5(C4)
Theorem 3.3(C2)

From these kharitonov rectangles the value set given in Figure 11(c) is directly obtained.

Finally, solving the equation system [10, equation ], the interval plant is obtained:

Applying at , and the value sets given in Figure 12 are obtained.

(a)  

(b)

(c)

Figure 12: Value sets obtained at , , and .

6. Conclusions

This paper shows how to obtain the values of the numerator and denominator Kharitonov polynomials of an interval plant from its value set at a given frequency. Moreover, it is proven that given a value set, all the assigned polynomials of the vertices can be determined if and only if there is a complete edge or a complete arc lying on a quadrant, that is, if there are two vertices in a quadrant. This necessary and sufficient condition is not restrictive and practically all the value sets satisfy it. Finally, the interval plant can be identified solving the equation system between the Kharitonov rectangles and the parameters of the plant.

The algorithm has been formulated using the frequency domain properties of linear interval systems. The identification procedure of multilinear (affine, polynomial) systems will be studied using the results in [11].

Acknowledgments

The authors would like to express their gratitude to Dr. José Mira and to Dr. Ana Delgado for their example of ethics and professionalism, without which this work would not have been possible. Also, the authors are very grateful to the Editor-in-Chief, Zhiwei Gao, and the referees, for their suggestions and comments that very much enhanced the presentation of this paper.

References

Z. Gao, X. Dai, T. Breikin, and H. Wang, “Novel parameter identification by using a high-gain observer with application to a gas turbine engine,” IEEE Transactions on Industrial Informatics, vol. 4, no. 4, pp. 271–279, 2008.

P. Van Overschee and B. De Moor, Subspace Identification for Linear Systems, Kluwer Academic, Boston, Mass, USA, 1996.

R. S. Sánchez-Peña and M. Sznaier, Robust Systems Theory and Applications, John Wiley & Sons, 1998.

B. R. Barmish, New Tools for Robustness of Linear Systems, MacMillan, New York, NY, USA, 1993.

S. P. Bhattacharyya, H. Chapellat, and L. H. Keel, Robust Control: The Parametric Approach, Prentice-Hall, 1995.

A. C. Bartlett, C. V. Hollot, and H. Lin, “Root locations of an entire polytope of polynomials: it suffices to check the edges,” Mathematics of Control, Signals, and Systems, vol. 1, no. 1, pp. 61–71, 1988.

M. Fu and B. R. Barmish, “Polytopes of polynomials with zeros in a prescribed set,” IEEE Transactions on Automatic Control, vol. 34, no. 5, pp. 544–546, 1989.

B. R. Barmish, “A generalization of Kharitonov's four-polynomial concept for robust stability problems with linearly dependent coefficient perturbations,” IEEE Transactions on Automatic Control, vol. 34, no. 2, pp. 157–165, 1989.

L. Ljung, System Identification: Theory for the User, PTR Prentice Hall, 1999.

R. Hernández, J. A. García, and A. P. de Madrid, “Interval plant identification from value sets with five vertices in a quadrant,” International Journal of Robust and Nonlinear Control, vol. 21, no. 1, pp. 21–43, 2011.

N. Tan, “Computation of the frequency response of multilinear affine systems,” IEEE Transactions on Automatic Control, vol. 47, no. 10, pp. 1691–1696, 2002.