資源簡介
matlab實(shí)現(xiàn)滾動時(shí)域估計(jì)算法(MHE算法),將估計(jì)問題轉(zhuǎn)化為優(yōu)化問題,基于粒子群算法求解最優(yōu)解,結(jié)合懲罰函數(shù)法來處理帶約束的優(yōu)化問題
代碼片段和文件信息
function?G=fitness(x)
G=0;
[A?B?C?T?N?P0?Q?R?n?m?p?jjx0]=matrix;
%%調(diào)用T時(shí)刻的測量輸出值:由y(0)y(1)......y(T-1)組成并儲存在y矩陣中
y=evalin(‘base‘‘y‘);
if?(T ????for?k=0:T-1
????????S=zeros(k*pk*p);
????????S1=zeros(k*p1);
????????if?(k==0)
????????G=G+y(m*k+1:m*k+m1).‘*inv(R)*y(m*k+1:m*k+m1)-2*x(11:n)*C.‘*inv(R)*y(m*k+1:m*k+m1)+x(11:n)*C.‘*inv(R)*C*x(11:n).‘...
????????+x(1n+k*p+1:n+k*p+p)*inv(Q)*x(1n+k*p+1:n+k*p+p).‘;%+(x(11:n)-jjx0(11:n))*inv(P0)*(x(11:n)-jjx0(11:n)).‘;%適應(yīng)度函數(shù)的具體表達(dá)式?
????????else
????????????for?t=0:k-1
????????????????S1(1+t*p:t*p+p1:n)=B.‘*(A.‘)^(k-1-t);?%求S1矩陣
????????????????for?j=0:k-1
????????????????????S(j*p+1:j*p+pt*p+1:t*p+p)=B.‘*(A.‘)^(k-1-j)*C.‘*inv(R)*C*A^(k-1-t)*B;%求S矩陣
????????????????end
????????????end
????????????G=G+
?屬性????????????大小?????日期????時(shí)間???名稱
-----------?---------??----------?-----??----
?????文件????????1415??2016-05-03?15:47??MHE.m
?????文件?????????670??2016-05-03?16:15??MHEdrawing.m
?????文件????????1597??2016-05-03?16:15??PSO.m
?????文件?????????745??2016-05-03?16:14??QIUY.m
?????文件????????2576??2016-04-25?12:21??fitness.m
?????文件????????1113??2016-04-26?09:46??matrix.m
?????文件?????????512??2016-05-03?16:27??Lfitness.m
評論
共有 條評論