Characterization and Computation of Robust Root Loci for Systems Having Parametric Uncertainties
Given an nth-degree polynomial p(s;q) whose coefficients are continuous functions of m-dimensional real vector q = (q0,q1,..., qm-1),the robust root locus (RRL)of the polynomial set p(s;Q)Δ= p(s; q):q∈Q(∪)Rm is defined as Ⅱp,Q Δ= s∈CC :p(s;q)=0 for some q∈Q where R and C denote the sets of real number and complex number, respectively. By exploiting the notion of generalized principal points of Q associated with a continuously differentiable mapping s: Rm→C, we present in this paper a necessary condition for (s,q) satisfying p(s;q) = 0 as well as s being on the boundary of the RRL Ⅱp,Q. For a general parameter dependency of the polynomial p(s; q), this condition renders analytic manifolds of dimension one in the domain CxQ. Hence, the boundary of each section of the RLL Ⅱp,Q can be accurately constructed via tracing the manifolds by a path-following algorithm. This approach to the construction of the RRL is applicable to the case where the parameter domain boundary (E)Q admits an analytic description. As compared with other existing methods of RRL generation algorithms, the proposed approach has the advantages of having more computational efficiency, more solution accuracy, and wider application scope. An example is given to illustrate the proposed approach of generating robust root locus.
Robust root locus Parametric uncertainty Principal point Generalized principal point
Chyi Hwang Shih-Feng Yang
Department of Chemical Engineering,I-Shou University,Kaoshiung 840,TAIWAN Department of Information Management,Transworld Institute of Technology,Douliou City,Yunlin County 6
国际会议
西安
英文
2007-08-15（万方平台首次上网日期，不代表论文的发表时间）