Ϣ
Information and Control
1999ꡡ285ڡVol.28No.51999



һɢLQŴ㷨
κּҺ㡡

ժҪһʵõɢLQĸĽŴ㷨״̬KȡֵΧȷһֱʿɱıӣ㷨Żٶȣ˸㷨ЧԣҸĽ㷨ڼŴ㷨
ؼʣɢLQ, Ŵ㷨, ռӳ
ͼţTP13ױʶ룺B

A GENETIC ALGORITHM FOR SOLUTION OF THE
DISCRETE LQ PROBLEM
WEI Peng1 LIN Jia-heng2 GENG Bao2
(1. Shandong Power Transmisson Co., Jinan 250022; 2. Dept. of Auto, Shandong University of Technology, Jinan 250061)
AbstractIn this paper,a kind of improved genetic algorithm is proposed for solution of the discrete LQ problem.A method to get the definite scope of the state feedback matrix K is presented.The genetic algorithm in whic h the mutation probability can vary is designed.This approach can improve optimi zation speed of the algorithm greatly.The results of the computer simulation sho w its validity and the improved algorithm is superior to the simple genetic alg orithm evidently.
Key wordsdiscrete LQ problem, genetic algorithm, parameter s pace map

1
ɢLQſеһ⣬ʵʿƹӦù㷺ľ䷽ͨRiccati̻״̬󣬶Riccati̱ȽϸӣҼϴ.
Ŵ㷨һֻȻѡȻŴѧϵ㷨[1]Ŵ㷨ҪŻǿɼģ޿΢ԼҪ÷Χ㣬Ҿȫ³Ժá򵥵ŵ㣬˸㷨ǵձӣ Żѧϰģʽʶ𡢲ʶſƵ˳ɹӦã[2]Ŵ㷨Զϵͳṹ⣬[3]Զ,ӦŴ㷨״̬KЩ,ûнŴ㷨 ״̬KȡֵΧȷ⣬KȡֵΧǸݾģͬʱ õķǼŴ㷨SGA(Simple genetic algorithm)㷨ļʱϳ Щ㷨ȱʵʵӦüֵ
[4]Ļ,ӡȶĸòռӳϵ һ״̬KȡֵΧȷһָĽŴ㷨IGA(Improved genetic algorithm)IGASGA
2KȡֵΧȷ
Զɿɢϵͳ:
X(k+1)=AX(k)+BU(k)(1)
X(k)Rn, U(k)Rm, ABֱΪӦάĳ״̬K KRnnʹſƹ
U(k)=-KX(k)(2)
ԶΪ
(3)
QRnn, RRmm,Q0,R0.
ɢLQ⣬Kһƹʽ
(4)
ɼʽ4ƳK󣬼㸴ӣʱܳҲŴ㷨⣬ȷKȡֵΧȡֵΧԽСŴ㷨ļʱԽ̣ ȷһʵKȡֵΧŴ㷨˵Ҫ
21 ȶ
Ϊ֤ջϵͳȶҾõʱԣջڸƽֲ򣬳Ϊ ȶLQſƣȶӦZƽ浥λԲڵĦL  ͼ1aʾ[4]ǵջλZƽ뵥λԲʱӦ̬Ƶʽϸߣʱջ㲻뵥λԲڣͬʱǵӳ㷽ѡȡZƽҰ뵥λԲڣ(1/2,0)ΪԲģ뾶Ϊ1/2ԲGΪȶͼ1bʾ

ͼ1 ɢLQȶ

ȶGȷɱ֤ɢſļãҿɴ СŴ㷨Ĳռ䣬Ч㷨ٶȣʹŴ㷨ʵüֵ 
22 ռӳ
ܿϵͳA,b״̬K=[k1,k2,,kn]ʲôΧȡֵ ֤ջϵͳֵȶڣɷȰȶGӳ 䵽ջac(z)ϵռaT=[a0, a1, , an-1] ȻٽaTӳ䵽Kռ䣮ɲռӳϵ֪Zġȶ߽Ϊ Բʱͼ2ʾԲڧTռ͹ʽ
i(z)=(z-L)i(z-R)n-i,i=0,1,2,,n(5)

ͼ2 ZƽƱջԲ

nΪϵͳĽˣһԲaTռ͹n+1㣮aTռ͹ӳ䵽KռҲ͹ֻ谴ļùʽӳռ͹㣺
K=[T, 1]E(6)
EΪþER(n+1)n:
E={eT,eTA,,eTAn}T(7)
eT=[0,0,,0,1][b,Ab,,An-1b]-1(8)
3Ŵ㷨
31 㷨һSGA
1) ùʽ58ȷ״̬KĽ⼯ΧöƶԽ⼯б룮ִıʾֵʵkIֵ֮¹ϵ
(9)
binrep(t)ΪһLλִʾĶ[kimax,kimin]Ϊkiı仯Χ
2) 2NĳʼȺP
3) ɹʽ3ȺÿĿ꺯ӦֵJ,ҳиJСֵJbest=Jmin
4) Ⱥѡ壬ȽӦֵӦֵСĸһȺP1УظNΣ
5) P1 ѡн㣮һִλţ ֱֳΣĺ໥ٽӴ뵽P2,ظ N/2ΣP11P2ϲγɰ2NȺP䣮
6) Ⱥеĸ尴Pmб㣮һִλţ ԸλϵĶȡ㣮
7) ȺÿӦֵҳӦֵСĸ壬J best=Jmin
8) жĳһСӦֵӦĸ10Σ ΪŽ򣬷ز4
32 㷨IGA
ʵSGAУPmSGAĵӰܴ󣮵PmʱÿһȺбĸĿӦӣȺлķɢԣʹʱ䳤ͬʱʹ㷨ֲС⣬ڵõȫŽ⣮PmСʱ㷨Ӱǡǡ෴Ϊ㷨ľȲСʱ䣬SGAĻϣһָĽŴ㷨IGA֮ڵ㣮SGAPmǹ ģIGAPmǿɱģPm𽥼Сֱ 
4ַ
¶ɢϵͳ


״̬Kʹָ꺯JСȶղռӳϵã


KռӳΪ

ͼ3ʾKÿһԪ16λַʾ һKһ32λַʾӦֵJn=30Ŵ㷨Ż㣬IGAÿ10 PmСʼֵ0.0116Ŵ㷨Ĳ1ʾͼ4ͼ5ֱ IGAƽֵֵı仯ߣ

ͼ3Kռӳ

ͼ4 ȺӦֵľֵ ͼ5 Ⱥ Ӧֵ

ʵԿIGAеPmϴʱȺĻ仯ңPm ļСܿ⣬۴Ӽ㾫Ⱥٶȷ棬IGASGA
1 SGAIGAŻȽ

SGASGAIGAȷ
N100100100
Pm1/3001/201/201/300
Pc0.9990.9990.999
J4.9178674.914934.9148354.9147
K[-0.663153,1.311194][-0.6592661.312025],[-0.666621,1.313991][-0. 66,1.31]
5920043
ʱ䣨룩5154


5
ɢLQ⣬һָĽŴ㷨.ȶĸͲ ӳϵ״̬KȡֵΧȷ⣬ЧؼС㷨ռ. Pnɱıӣ˼㾫Ⱥٶ.˸㷨ʵӦüֵ. ڶϵͳȷKȡֵΧдһо.
߼飺κУ1971꣬˶ʿоҵоΪſƣܿƣ
ּҺ㣬У1947ڣоΪܿơŻ
У1951߼ʵʦоΪϵͳ桢ƣ
ߵλκɽͱ繫˾  250022; ּҺ㡢
ɽҵѧԶϵ 250061
ο
1Holland,J.H. Adaptation in Natural and Artificial Systems. The University of Michigan Press. Ann Arbor,MI,1975
2¸磬ºŴ㷨ṹã `93ۼӦ ļ人19931115
3¸磬ºӦŴ㷨Զҵѧѧ1994122247253
4ϵͳ³ƣѧ磬1992247305
ոڣ1998-05-12
