Զѧ
ACTA AUTOMATICA SINICA
1997 23 3 vol.23 No.3 1997



RGIA㷨QRֽʵ
硡
ժҪƱʶ㷨һʽ(RGIA)QRֽʵַƵӦĻHOUSEHOLDER任Ŀٵ㷨.㷨ڸֵƱʶ㷨УԼСۺʹݣ߱ʶȣͬʱ˼.ֵ㷨ȷ.
ؼʡϵͳֻƣQRֽ⣬ϵͳHOUSEHOLDER任ٵ㷨.
IMPLEMENTATION OF RECURSIVE GENERAL IDENTIFICATION
ALGORITHM VIA QR DECOMPOSITION
MENG XIAOFENGWANG XINGREN
(Dept. of Automatic Control, Beijing University of Aero. and Astro. Beijing 100083)
AbstractAn implementation method with QR decomposition for recursive general identification algorithm (RGIA) is proposed and a corresponding fast recursive algorithm based on HOUSEHOLDER transformation is developed in this paper. This algorithm can be used in all sorts of identification methods to get better numerical stability and less numerical complexity. Finally, simulation study on this algorithm is made, whitch shows that this implementation method is correct.
Key words System identification, parameter estimation, QR decomposition, multivariable system, HOUSEHOLDER transformation, fast recuasive algorithm.
1
Ʊʶ㷨һʽΪ12
(k)=z(k)-(k),(1a)
(k)=(k-1)+K(k)(k),(1b)
K(k)=(k)R-1(k)(k)1(k),(1c)
(k)=(k-1)+(k)(k)(k)-(k-1),(1d)
R(k)=R(k-1)+(k)ۦ(k)1(k)(k)-R(k-1),(1e)
x(k+1)=A((k))x(k)+B((k))(k),(1f)
(1g)
(k)=z(k),u(k)ݦ.(1h)
Сz(k)Rm1u(k)Rr1Ϊ̵ݣ(k)RN1ʾkʱ̵Ĳֵ(k),(k)(k)x(k)ֱkʱ̵ԤֵϢԤֵڲȵĵԤģ͵״̬(k)ӣR(k)HessianĽʽK(k)Ϊ(k)в(k,0)ЭĹֵ.RGIA㷨ѽʶ˼ͳһԤֵڲݶȵƵ⣬㷨Կһ.RGIA㷨ϾҪ壬㷨Էߣ1,2.
RGIA㷨Ĳݣ1)Ԥ(k)2)K(k)3)ֵ4)Ԥֵ(k)ڦȵݶ.1)3)ļ漰ǰ5ʽӾй̶Ľṹʽõģ޹أ˿Կһֵо.K(k)ļRGIA㷨Ĺؼ漰(k)R(k)㣬㷨ʵִ.Ϊ˽һ⣬Ҫ跨ĵȼʽ.ͨõķþݹʽ(1c)(1e)ʽһֲĵȼʽ(RCKE)1.һʶ㷨RCKE㷨P(k)ļۻǲ϶ʱ.
ĽRGIA㷨QRֽʵַƵӦĻHOUSEHOLDER任(H-任)ļ㹫ʽ.
2RGIA㷨QRֽʵԭ

P(k)=(k)R-1(k), (k)=(k)-1(k),(2)
(1c),(1d) (1e)ʽɷֱд
K(k)=P(k) (k)(k)/(k),(3a)
(k)=ۦ(k)1(k-1)+(k)(k)-1(3b)
P(k)=ۦ(k)P-1(k-1)+(k)(k)(k)/(k)-1(3c)
С(k)=(k-1).(1-(k))/(k).
k-1ʱ̵(k-1),ǾR(k-1)ʹ
1(k-1)=RӦ(k-1).R(k-1).(4)
k-1ʱ̵ǾR(k-1)kʱ̵Ϣ(k)
F(k)=ۦ(k)RӦ(k-1)(k)ݦ.(5)
ʽС2(k)=(k).F(k)任T(k)ʹǻ
T(k).F(k)=RӦ(k)Oݦӣ(6)
ǣkʱ̵ľ(k)ԱʾΪ
(7)
ˣ(3b)ʽļ(5)(7)ʽ.
ͬP(k-1)ǾRp(k-1)ʹ
P-1(k-1)=Rp(k-1)Rp(k-1)(8)
(6)ʽļR(k)Kʱ̵Ԥֵڲȵĵ(k)
(k)=(k)R1(k)/(k).(9)
æ(k)k-1ʱ̵ǾRp(k-1)
Fp(k)ۦ(k)Rp(k-1),(k)ݦӣ(10)
С2(k)=(k).任Tp(k)ʹǻ
Tp(k)Fp(k)Rp(k)Oݦ.(11)
(7)(8)ʽ(3c)ʽ
P(k)=ۦ(k)Rp(k-1)Rp(k-1)
+(k)R1(k)RӦ(k)(k)/(k)ݣ1.(12)
(9)(12)ʽ
(13)
ˣ(3c)ʽļ(9)13ʽ.(7)(13)ʽ(3a)ʽǵ(9)ʽ
K(k)=R-1P(k)R-P(k)(k)R1(k)RӦ(k)/(k)
=R-1P(k)RP(k)(k)RӦ(k)/(k).(14)
(14)ʽ(1b)ʽ
(k)=(k-1)+R-1P(k)R-P(k)(k)RӦ(k)(k)/(k).(15)
RGIA㷨(1b)(1e)ʽļ(5)(6)(9)11(15)ʽ.
1.ھ󷽳(11)УTp(k)ֿΪ
(16)
 G11(k)RNNG12(k)RN1G21(k)RmNG22(k)RmmӾ
RP(k)G-11(k)(k)R(k-1),(17a)
RP(k)G11(k)(k)Rp(k-1)G12(k)(k),(17b)
RP(k)(k)G12(k).(17c)
֤.ݷֿ湫ʽ1ԼTP(k)ԣ

(18)
ʽ
A=G11(k)-G12(k)G-122(k)G21(k).(19)
(18)ʽ
G-11(k)=G11(k)-G12(k)G-122(k)G21(k).(20)
TP(k)Tp(k)=I
G11(k)G12(k)+G21(k)G22(k)=0.(21)
(16)ʽֿ(11)ʽȽϵʽ˿ɵ(17b)ʽ
G21(k)(k)RP(k-1)+G22(k)(k)=0.(22)
(22)ʽ
(k)=-G-122(k)G21(k)(k)RP(k-1)(23)
(23)ʽ(17b)ʽǵ(20)ʽ
RP(k)(G11(k)-G12(k)G-122(k)G21(k))(k)Rp(k-1)
G11(k)(k)RP(k-1)(24)
(17a)ʽ֤.(23)(17a)(21)ʽ
RP(k)(k)=G11(k)R-P(k-1)-G-122(k)G21(k)Rp(k-1)ݦӡ
=G11k)G21(k)G22(k)=G12(k).(25)
֤.

e(k-1)=RP(k-1).(k-1),(26)
v(k)=R-Ӧ(k)((k)+(k)(k-1))/(k),(27)
(G11(k)G12(k)((k)e(k-1)v(k))=e(k),(28)
Сv(k)Rm1e(k-1) & e(k)RN1.
2.RGIA㷨kʱݵĲֵΪ
(k)=R-1P(k)e(k).(29)
֤.(17c)ʽ(15)ʽ
(k)=(k-1)+R-1P(k)G12(k)RӦ(k)(k)/(k).(30)
(17bʽ(30)ʽ
(k)=R-1P(k)(RP(k)(k-1)+G12(k)RӦ(k)(k)/(k))
=R-1P(k)(G11(k)(k)RP(k-1)+G12(k)ӣk)(k-1)
+G12(k)RӦ(k)(k)/(k)).(31)
(9)ʽ(31)ʽǵ(26)28ʽ
(32)
֤.
RGIA任㷨ɱʾΪ
(1a)ʽ
(33a)
(k)=(k)R1(k)/(k),(33b)
v(k)=R1(k)/(k)ݣ(k)+(k)(k-1),(33c)
(33d)
(k)=R-1P(k)e(k),(33e)
1f)-(1h)ʽ.
ʼ
(34)
㷨Ȩȡ1(k)=ImR1(k)/(k)=Iʱ(33*)ʽɼΪ

3RGIA㷨H-任ٵ㷨
SISOϵͳ(33d)ʽеĦ(k)(33a)ʽе(k)ֱף4H-任ٵƹʽʵ(33a)(33d)ʽ任.
MIMỌΪH-任ٵƹʽϢ((k)RP(k-1)(k)e(k-1))Ϣ((k)v(k))ʱɲӷʽƵ.
3.NNάֿ
(36)
(N+m)(N+m)άֿ
(37)
 Inʾn׵λ.TTҲ.
֤.ȻTT=INƵTT=Im+N.֤.

(38)
R0k)=(k)RP(k-1);e0(k)(k)e(k-1).(39)
4.ʽ(33d)е任TP(k)µm任ʵ֣(N+1)ϢFi(k)Ӧ任Ti(k)Ϊ
(40)
СRi(k)ΪNei(k)ΪNάi(k)Ϊ.
֤.(40b)ʽTi(k)(37)ʽTip(k)ȡ
Tp(k)=Tmp(k)Tm-1,p(k)T1p(k).(41)
ݶ3ʣ֪Tp(k)Ϊ.ңùɷ֤
(42)

(k)=ۦ1(k),2(k),m(k)ݦӣ(43)
֤.
(40)ʽ任ֱף4H-任ٵƹʽʵ.
MIMO̵RGIA任㷨ʾΪ

ʼͬ(33*).
4ܱȽ
Ȩȡ(k)=1ҹΪʱּ㷽ļ㸴ԱȽϣ1ʾ.
1ּϢ󷽷ļ㸴ԱȽ

㡡ˡ㡡
ӡˡ
RCKE㷨1.5N2+3.5N1.5N2+4.5N0
U-DֽN3/6+1.5N2+8N/6N3/6+1.5N2+44N/60
ķN23NN29N0

SISOģ
A(z-1).y(k)=B(z-1).u(k)+B(z-1).w(k),(45)
Уw(k)ǾֵΪУ
A(z-1)=1.0+a1z-1++anaz-na,
B(z-1)=b1z-1+b2z-2++bnbz-nb,
D(z-1)=1.0+d1z-1++dndz-nd.
(45)ʽƵԤֵıʽΪ
(k)=h(k,).ȣ(46)

h(k,)=(-y(k-1),-y(k-na),u(k-1),
u(k-bn),(k-1,),(k-nd,))ӣ(47)
=(a1,ana,b1,bnb,d1,dnd).(48)
Ԥֵڲȵݶȿд
(k)=(-zf(k-1),-zf(k-na),uf(k-1),
uf(k-bn),f(k-1,),f(k-nd,))ӣ(49)

(50)
вд
(51)
ȨȡΪλʱRGIA㷨˻ΪƵļȻ(RML)
(52)
Ӧ任㷨Ϊ(ΪRHT-ML)
(53)
.(45)ʽУu(k)÷Ϊ1.0αУw(k)ķΪ1.0.RML㷨(52)ʽRHT-ML㷨(53)ʽУȡƳֵRP(0)=106IP(0)=106I(0)=0,(0)=0,h(0)=0ȡ((k)=(k))
(k)=0.99*(k-1)+0.01,(0)=0.95.(54)
23ֱ˲õȺ˫ʱ㷨ıʶȽ.RML㷨ʮУõ(4ֽڵĸ)ʶ˲˫(8ֽڵĸ)㣻RHT-ML㷨ǲõȻ˫ȸ㣬ɻúܺõıʶ.ɼRHT㷨ȣRHT-ML㷨ֵȶԺáʶȸ.
2õʱRMLRHT-ML㷨ıʶȽ

(ֵ)RMLRHT-ML
L=100L=500L=1000L=2000L=100L=500L=1000L=2000
a1(-1.6)-1.3584-1.0060-1.74395.3229-1.2629-1.5423-1.6525-1.5946
a2(1.61)1.41091.57571.8040-22.2281.32471.56591.65051.6033
a3(-0.776)-0.5542-0.5759-0.90192.2523-0.4620-0.7228-0.8271-0.7681
b1(1.2)1.09832.32631.0705-6.18931.06261.20491.23971.1949
b2(-0.95)-0.5459-5.2059-0.376688.404-0.4947-0.8665-1.0346-0.9889
b3(0.2)0.23122.44121.800924.6460.08070.26690.16360.1713
d1(0.1)0.3658-0.23850.2984-0.34950.03790.07770.10410.0939
d2(0.25)0.06910.4781-0.0026-6.22950.15730.22490.19780.2175
d3(0.875)0.32770.95210.0043-2.96930.25740.73460.73620.8200

3˫ʱRMLRHT-ML㷨ıʶȽ

(ֵ)RMLRHT-ML
L=100L=500L=1000L=2000L=100L=500L=1000L=2000
a1(-1.6)-1.3638-1.5684-1.5982-1.5998-1.4087-1.5696-1.5989-1.6002
a2(1.61)1.41371.58331.60811.61041.45041.58421.60851.6106
a3(-0.776)-0.5593-0.7452-0.7749-0.7767-0.5998-0.7463-0.7755-0.7770
b1(1.2)1.10021.18821.22971.20951.07161.18751.22931.2095
b2(-0.95)-0.5522-0.9098-0.95380.9514-0.6352-0.9125-0.9551-0.9518
b3(0.2)0.22560.21790.21380.21380.21830.21640.21350.2138
d1(0.1)0.36210.11000.11210.08310.34240.11080.11240.0833
d2(0.25)0.05900.20260.23350.23250.07680.20150.23340.2325
d3(0.875)0.32640.72170.81580.85010.35780.72460.81680.8502

߼飺硡1995ڱպѧʿѧλθУԿϵ.Ŀǰоǲơݴпз.
ʡ1955걱ѧԺоҵ.αպѧԿϵڡʿʦƹίƼίְίԱ;÷漼רҵ鸱鳤.1985ҿƼһȽ.ĿǰоǷпз桢ݴ.
ߵλպѧԶϵ100083
ο
1ݷǣ.̱ʶ.廪ѧ磬1989424430.
2Ljung L, Soderstron T. Theory and practice of recursive identification, combridge Mass: MIT Press, 1983.
3Ljung S, Ljung L. Error propagation progerties of recursive least squares adaptation algorithms. Automatica, 1985,21:157-167.
4磬ʣƿ.С˹ƵHouseholder任ٵ㷨.Զѧ199420(1)2027.
5Bierman G J. Factorization. Methods for Discrete Sequential Estimation, New York: Academic Press, 1977.
ոڡ1994-12-15
