论文部分内容阅读
In this paper, it is shown that for low-order uncertain systems, there is no need to calculate all the minimum and maximum values of the coefficients for a perturbed system which is expressed in terms of polynomials and hence no need to formulate and test all the four Kharitonov’s polynomials. Furthermore, for higher-order systems such as n 5, the usual four Kharitonov’s polynomials need not be tested initially for sufficient condition of perturbed systems; rather, the necessary condition can be checked before going for sufficient condition. In order to show the effectiveness of the proposed method, numerical examples are shown and computational efficiency is highlighted.
In this paper, it is shown that for low-order uncertain systems, there is no need to calculate all the minimum and maximum values of the coefficients for a perturbed system which is expressed in terms of polynomials and therefore no need to formulate and test all the four Kharitonov’s polynomials need not be tested initially for sufficient condition of perturbed systems; rather, for higher-order systems such as n 5, the usual four Kharitonov’s polynomials need not be tested initially for sufficient condition of perturbed systems; rather, the necessary condition can be checked before going for full condition. to show the effectiveness of the proposed method, numerical examples are shown and computational efficiency highlighted.