Զѧ
ACTA AUTOMATICA SINICA
1999ꡡ255ڡVol.25 No.5 1999



ϵͳĵݽױʶ1)
桡ұ
ժҪϵͳصάߡƵĲĿ࣬ʹñʶļʹ洢ӣ³ʶ㷨ʵ.Ϊ˼ٴϵͳʶļ˼Сĵݽױʶ㷨֤.˵㷨Ըϵͳһ¹.
ؼʡϵͳʶƣݽױʶ
HIERACHICAL IDENTIFICATION OF LARGE SCALE SYSTEMS
DING FengYANG Jiaben
(Department of Automation, Tsinghua University, Beijing100084)
AbstractLarge scale systems have so many parameters that ordinary identification algorithms have too much computational burden to realize in computer. In order to reduce the computational burden we present a hierachical identification algorithm of large scale systems and apply the martingale hyperconvergence theorem to its convergence. The results show that the proposed algorithm may give the consistent parameter estimation of large scale systems.
Key wordsLarge scale system, identification, parameter estimation, hierachical identification.
1
ԻعģĶ̬ϵͳ
y(t)=T(t)+v(t)(1)
y(t)Ϊϵͳ(t)Rn(t-1)ʱϵͳy(t)u(t)ɵĻعϢȡRnΪʶĲv(t)ΪֵάnܴϱTʾת.
ȻƱʶ㷨С˷

(2a)
(2b)
P-1(t)=P-1(t-1)+(t)T(t)(2c)

(2b)
ڴϵͳ(1)Ĳ.ڴϵͳάߣʹƵĲĿ࣬ʹùƷļʹ洢ӣ㷨ʵɼѣνġά֡1.ˣоϵͳķֽʶ㷨Сıʶ㷨ѳΪȻ.
2ݽױʶ㷨
ݽױʶĻԭǣȽϵͳֽΪάСĿٵϵͳȻֱÿϵͳĲ.ǣڸϵͳڹҲ˵iϵͳһЩϵͳδ֪j(ji)ʹõԽУΪ˽һ⣬ڼtʱ̦iĹʱϵͳδ֪j(ji)(t-1)ʱ̵Ĺֵ(t-1).ǽϵͳ(1)ϢͲֽΪNάΪniϢͲ
(3)
i(t)RniiRni,n1+n2++nN=n.(4)
ǿ԰ϵͳ(1)ֽΪNϵͳǿԱʾΪ
yi(t)=Ti(t)i+v(t),i=1,2,,N,(5)

yi(t)=y(t)-i(t),(6)
i(t)=(7)
i(t)ΪϵͳĹ.
v(t)ǰʸСԭɻòiƫ.ϵͳ(5)iĵС㷨Ϊ
(8a)
(8b)
P-1i(t)=P-1i(t-1)+i(t)Ti(t).(8c)
(8a)ʽyi(t)ǹi(t)ĺϵͳδ֪j(ji)Ϊ˽еƼ㣬(t-1)ʱ̵Ĺֵ(t-1).(6)ʽ(8a)ʽá(t-1)jɵ


(9a)
(9b)
P-1i(t)=P-1i(t-1)+i(t)Ti(t).(9c)

Pi(t)=I-Li(t)Ti(t)Pi(t-1)(9d)
(0)=Сʵ
i=1,2,,N.
㷨(9)Ǵϵͳ(1)ĵݽױʶ㷨.
P-1(t)=diagP-11(t),i=1,2,,NΪֿԽ󣬼
(10)
(11)
ǣ㷨(9)Եȼ۸дΪ
(12a)
P-1(t)=P-1(t-1)+diagۦi(t)Ti(t),i=1,2,,N,(12b)

Ƚϳʶ㷨(2)͵ݽױʶ㷨(9)ļ.
ʶ㷨(2)͵ݽױʶ㷨(9)ÿһļС1ʾ.1Сʾn=100N=10ni=10,i=1,2,,Nʱֲ㷨ļ.ӱ1ԿС˷ļܴ󣬶ݽױʶ㷨(9)ļСö.
1С˱ʶ㷨ݽױʶ㷨Ƚ

Ʒ˷ӷ
С˷2n2+4n
(20400)2n2+2n
(20200)
ݽױʶ㷨(2n2i+4ni)
(2400)(2n2i+2ni)
(2400)

3ݽױʶ㷨Է
v(t)Ƕڸʿռ(,F,P)ϵ(Martingale)УӦڵ-(Ft,tN)Ftֱtʱ̵Ĺ۲ɵĦ-F0гʼϢ.
֤ݽױʶ㷨(9)õ.
1.Գƾ

IAܦIIΪλ󣬦Ϊ0ܦ£.

֤.֤ܼ򵥣.
2.ڴϵͳ(1)ڳp,ʹǿ

裬ôЭH(t)
H-1(t-p)+pIH-1(t)H-1(t-p)+pI

(t-p)IH-1(t)ܣۦ(t+p)+aI
֤.

ó(A1)ɵ
H-1(t-p)+pIH-1(t)H-1(t-p)+pI.
t=pi+k,0kp,
H-1(t=pi+k)H-1p(i-1)+k+pI=
H-1p(i-2)+k+2pI=H-1(k)+ipI
H-1(0)+(i+1)pIH-1(0)+(t+p)I.=
ۦ(t+p)+aI.
ͬ
H-1(t=pi+k)H-1(k)+ipIipI(t-p)Itp.
֤.
1.ڴϵͳ(1)ǿ(A1)v(t)
(A2)Ev(t)Ft-1=0a.s.
(A3)Ev2(t)Ft-1=2v(t)ܦ2vޣa.s.
(A4)
ôݽױʶ㷨(9)(12)Ĳ(t)һ(a.s.)ȣһ㣬



ǷʶԵҪߣ26ݣ7֤.
֤.ֱӷ㷨(12)Լѣȼ㷨(12)Ȼ֤ԣͿɼ˵ԭ㷨.(12b)ʽЭP(t)ԱʾΪ

12ɵ
(t-p)IP-1(t)ܣۦ(t+p)+aI,


ɴ˿԰㷨(12)޸Ϊ
(13a)
(13b)
ֻҪ֤㷨(13)áʣۦ,£ݶ.

(14)
(13a)ʽ߼ȥȣ(1)ʽ룬
(15)

(16)
(15)ʽȡ

(17)
(A1)ȡɵã(t)2np£tִʱt+c-(t)20
(18)
ü(A1)(A4)v(t)Ft-1ɲģ(18)ʽ߶Ft-1ȡõ
(19)

(20)
Ǽ


ע⵽RtN(Rt)ڡNc(Rt)Nc(Rt)N(Rt)Ĳݣ
(21)
Ӧף7ڳִtСN(Rt)ڦģ


(22)
ʽ ͿԵõһĽۣƵ£

(23)
(15)ʽɵ
(24)
(16)ʽԦ(t)ɵ




(25)
(25)ʽ߶ii=0i=p-1ͣõ
(26)
ʽȡ*ó(A1)
(27)
ùʽ(a+b)22(a2+b2)ɵ
(28)


(A2)(A4)(22)ʽɵ
(29)
(30)
(28)ʽȡޣע⵽(29)(30)ʽѵõĽ.
4ᡡ
ϵͳʶ㷨ļһֱǱʶд֮һ.ĵݽױʶ㷨ڹƴϵͳĲмСռڴ٣ʵֵص.ϵͳʶ㷨ԷѣƵط˵ݽױʶ㷨ԣȷطԼǽд˵Ŀ.
1) ȻѧĿ.
߼飺桡У1963.19901994廪ѧԶϵֱ˶ʿѧλͲʿѧλ.廪ѧ.оȤΪӦʶƼӦãѷѧʮƪ.
ұУ1935.廪ѧԶϵڣʿʦ.оȤΪϵͳ֯ϵͳ.
ߵλ廪ѧԶϵ100084
ο
1ϯԣ.̬ϵͳ.ҵ磬1988
2棬л.ϵͳС˷Է.ߣ19927(6)443447
3.ϵͳĸģͱʶԷ.Ӧã199714(2)192200
4棬л.ϵͳĸģͱʶ㷨.廪ѧѧ(Ȼѧ)199232(4)100106
5棬л񣬷.ʱϵͳʶĶϢ.Զѧ199622(1)8591
6Ding F, Xie X M, Fang C Z. The convergence of the forgetting factor algorithm for identifying time-varying systems.Control Theory and Applications,199411(5)634638
7棬С㷨Է.Ӧã199714(1)9095
ոڣ1997-09-04
޸ڣ1998-02-25
