Զѧ
ACTA AUTOMATICA SINICA
1998 24 4 Vol.24 No.4 1998




״̬ϵɢϵͳȶԼ1)
Ф
ժҪϵͳϵͳı仯״̬ϵɢϵͳģ͡ȶԼ鶨ȶԼĿ㷨.ϵͳȶĳֱҪ䴫ݺķĸʽΪSchurʽ.˸ĽıϵSchurʹϵͳȶԼ̼򻯣Ϊ٣޴㼴.
ؼʡ״̬ϵɢϵͳȶԼ鶨㷨.
STABILITY TEST FOR FINITE STATE VARIANT
COEFFICIENTS DISCRETE SYSTEMS
XIAO YANGDU XIYU
(Institute of Information Science,Northern Jiaotong University, Beijing100044)
AbstractThe paper proposes the model,stability test theorem s and their fast algorithm for the discrete systems with finite state variant coefficients which vary independently with the system's clock.The necessary and sufficient condition for stability of this kind of systems is that the denominator polynomials of their transfer functions are finite Schur polynomial family.The stability test procedure has been simplified by improved Schur test table with variant coefficients,and the computation amount has been reduced and can be completed by finite computations
Key wordsFinite state variant coefficients' discrete systems,s tability test theorems and algorithm.
1
һද̬ɢϵͳϵͳΪ״̬仯(m)ϵͳĽ(n)첽mn޹أòַ̱ʾΪ
(1)
״̬ϵɢϵͳĿڣһǷϵͳ仯Ķ̬ɢϵͳȶԣϵͳĲռΪ״ṹеĹϵͳ仯Ķ̬ɢϵͳ³ȶԽһֻΪ֮ṩ൱ıԣΪϵͳ仯Ķ̬ɢϵͳ³ȶԷṩһֵ㷨ϵͳռ׷Ѱȶӿռ䣻ǽϵͳϵͳĽ(n)仯ʱĶ̬ɢϵͳȶԷ⣬ʱϵͳɱʾΪɢmĺ.ϵͳ֮ص.ƪֻҪ.
ף12ݵָģKharitonovϵͳΪϵͳ³ȶԼ飬ԱĶද̬ɢϵͳ.ͬڶϵɢϵͳʽ(1)ϵͳϵΪάɢУϵͳĴݺΪ
H(z,m)=A(z,m)/B(z,m).(2)

(3a)
(3b)
m=0,1,M(M).MΪϵɢϵͳϵ仯״̬.ʽ(1)ϵͳʵʶӦ޸״̬ϵͳ.״̬MʱϵͳϵΪ仯.ϵͳϵޱ仯ʱ(m=0)ʽ(1)ɢϵͳΪɢϵͳ
H(z,0)=A(z,0)/B(z,0).(4)
ϵͳϵı仯ƫΪan=a(n,m)-a(n,0), bn=b(n,m)-b(n,0).
ʽ(1)ϵͳؽȶԼʱϵͳеÿһϵͳԪزͬϽм.ʱÿһϵM״̬ϵͳΪN(N+1ϵ)ϵͳԪزͬΪCN+1M(N+1)Ӵ.ף13ݵļ鷽ʺϵͳϵռΪģʽ(1)ϵͳصļ൱ıԣֻṩȶĳ. ʽ(1)ϵͳȶԣɽһ.
1. ״̬ϵɢϵͳ(1)BIBOȶģҽ
(5)
֤.
״̬ϵɢϵͳĲ״̬mϵͳn޹أˣȶԼʵ䴫ݺķĸʽ飬B(z,m)ǷΪSchurʽ.ɢϵͳĲ״̬mϵͳnйأmΪnԺϵͳܱʾΪݺʽӦ״̬ռ䷽̱ʾϵͳʽ޵λԲ㲻һܱ֤ȶԣһǽ.

2״̬ϵʽб㷨
ף56ݶSchurб鷨˸Ľʹб1ʽ˼.Сڱʵ.ʽ(5)b(n,m)ΪʽB(z,m)ıϵ1ʾļ.
1״̬ϵʽ

iz0z-1Z-2Z-(N-2)Z-(N-1)Z-N
0b0,0(m)b0,1(m)b0,2(m),b0,N-2 (m)b0,N-1(m)b0,N(m)
1b1,0(m)b1,1(m)b1,2(m),b1,N- 2(m)b1,N-1(m)

N-1bN-1,0(m)bN-1,1(m)


иϵ㷨ɣi=0ʱ
b0,n(m,n)=b(m,n)(6)
еĵ0Ϊʽıϵ.i1ʱʽƳеϵ
(7)
ڸñУbi,k(m)Ǳϵ.
½ڽ֤ʽB(z,m)㶨1ĳҪǣϵb(n,m)ڱ1Ӧ㣺m=0,1,,M,
bi,0(m)bi,N-i+1(m)0,i=0,,N-1.(8)
iΪкţbi,0(m)bi,N-i+1(m)ֱǱеiеĩ.
ʽ(8)ɵһ麯
Di(i,m)=bi,0(m)bi,N-i+1(m)i=0,,N-1.(9)
ʽϵ״̬MܴʱͳһάSchurҪMбMʱϵΪƽ仯ʱҪбȻǲܵ.Ϊһ⣬Ƕ麯Di(i,m)󣬿ݲ״̬ԸϵΪʼֱбõΨһļ麯Di(i,m).ü麯ǶʽıϵĶظϺ.״̬m仯ʱطüֻжϼ麯Ƿ.ֻһбɵõļ麯Ӷʹ̼򻯣Ϊ.ʽ(7)̣1ıϵ.Di(i,m)Ƿʽ(8)жʽǷеλԲ.
3״̬ϵɢϵͳȶԼ鶨
Ϊ˼ʽ(8)ǽṩһЧ.
2. ϵʽ
(10)
ҽB(z,m)
a)B(1m)0(11a)
b) NNϵΪ.
(11b)
֤. ף4ݵĵ5.3ڣ򵥵Ĵbn=b(n,m),n=1,,N,.
ʵϣ2ļѱΪSchur.ж˵.
3. ҽ״̬ϵʽ(5) 
a)B(1,m)0m=0,1,,M,(12a)
b)D(i,m)0,i=0,,N-1,(12b)
m=0,1,M,öʽ޵λԲ㣬D(i,m)ʽ(9).
֤. ף4ݵĵ5.3֪Schur붨2ϵʽ(11b)Ӧʽ(11b)Ϊʱ1ϵʽ(12b)ʽ(12a)ʽ(11a)һ.ɶ2ɵöʽB(z,m)޵λԲ.
֤
23ȷSchurʽأ䲻ͬڣ2Զʽϵÿһα仯(11b)ԣӴ󣬲Ҫ֪ʽϵȷֵԲȷʽأ޷3Schurɼ麯Di(i,m).ڸü麯ǶʽϵĶظϺڲ֪ʽϵȷֵɣˣ3ɶԲȷʽص״̬SchurȶԼ.Ȼڶʽϵ仯Ĳȷʽأ״̬m麯Di(i,m)ΪmΪֵʱ3Զʽϵ仯ĲȷʽֻṩSchurȶԵıҪ.3ڲȷʽصϵռȷSchurʽصӿռ.⣬23Զʽıϵ֮Ƿδƣˣʽıϵ֮ԻԹϵ.

4Ӧþ
ƪ۶3ʽӦ.ʽϵͳʽ(1)ϵͳʽͬڣʽϵͳֻϵ½磬ϵ½ڵı仯ȷʽ(1)ϵͳɽϵռɢֵƽȶԷ.һ棬ʽ(1)ϵͳҪȶӿռ㼯.ԣö3֤ģ2еʽ³ȶԵı߽鷴ȷ״̬ɢʽȶӿռ㼯.1ɢKharitonovʽĶ˵ȶȻȴSchurʽ.
1.ж3׶ʽǷΪSchurʽأ2,ȷ״̬ɢʽȶӿռ䣬
B(z,b)=1+b1z-1+b2z-2+b3z-3.
1)ϵռ䣺b1ʣ-0.5,0.25,b2ʣ-0.5,0.5,b3ʣ-0.5,0.25.
2)ϵӿռ䣺b1ʣ-0.333,0.25,b2ʣ-0.333,0.5,b3ʣ-0.333,0.25.
. 1)ϵռ䰴0.25ĲɢϵΪb1ʣ-0.5,-0.25,0.025,b2ʣ-0.5,-0.25,0.025,0.5,b3ʣ-0.5,-0.25,0.025.
ñ1ɼ麯D(i,m),Ƿ㶨3b1=b2=b3=-0.5 ʽ(12).ݶ3B1(z,m)ڵλԲ.ˣB(z,b)Schurʽ.
2) ϵռ䰴0.001Сɢ1飬㶨3ݶ3޶ʽB2(z,m)ڸɢϵռ޵λԲ㣬ΪSchurʽ.
3ʽSchurȶԵıҪǳʽϵռģ3Ҫϵͳϵռɢ.״̬ϵɢϵͳ3ȶĳֱҪ.
1)ȻѧĿ.
ߵλͨѧϢѧо100044
ο
1Ф.̬ݹ˲³ȶԼ.ͨѧѧ199519(3)277-281
2Joanna Cieslik.On Possibilities of the Extension of Kharitonov Stability Test for lnternal Polynomials to the Discrete Case.IEEE Trans.Automatic Cont rol,1987,32(3):237-238
3Ackermann J E and Barmish B R.Robust Schur Stability of a Polytope of Polynomials.IEEE Trans.Automatic Control,1988,33(10):98 4_986
4LaSalle J P.The Stability and Control of Discrete Processes.New York:Springer-Verlag,inc.1986,Chapter 5
5Ф.άɢάĶʽĸϵб鷨.ӿѧѧ199517(6)81-85
6ڣФ.ά˲.ҵ磬1995
ոڡ1996-03-16
