Interval plant identification from value sets with five vertices in a quadrant

Abstract

AbstractThis paper shows an algorithm for the identification of interval plants from the vertices of the value sets. In order to do this, first several main properties of the value‐set boundary are shown. Then a main result to obtain the values of the numerator and denominator Kharitonov polynomials is developed. This algorithm is non‐conservative in the sense that if the value‐set boundary of an interval plant is exactly known, and particularly its vertices, then the interval plant identified is exactly the one used to obtain these value sets. Copyright © 2010 John Wiley & Sons, Ltd.