基于ADMM交替方向乘子法的超大规模储备系统分布式协同优化算法收敛性matlab仿真与分析-拓冰建站

1.课题概述

基于ADMM交替方向乘子法的超大规模储备系统分布式协同优化算法收敛性matlab仿真与分析。为了验证算法在超大规模储能系统中应用的可行性，在一个由10/21个子储能系统构建的仿真环境下进行测试分析。

2.系统仿真结果

3.核心程序与模型

版本：MATLAB2022a

.....................................................................%条件约束for i = 1:Numsif Psts(i,k+1)<=-psdsmax(i)+SOCca(i)Psts(i,k+1)=-psdsmax(i)+SOCca(i); endif Psts(i,k+1)>=psdsmax(i)-SOCca(i)Psts(i,k+1)= psdsmax(i)-SOCca(i); endend %公式18Pgrid = sum(Psts(:,k+1))-Pr;for i = 1:Numstmps  = [];for j = 1:length(Niset{i})tmps(j) = lemda(i,k)+lemda(Niset{i}(j),k);endlemda(i,k+1) = (sum(tmps) -(u(i,k)-Psts(i,k+1)+(Pgrid - Pr)/bn))/2/(absNi(i));endFc(k) = sum(Psts(:,k))-obj;
figure;
subplot(121)
plot(lemda');
xlabel('迭代次数')
ylabel('lemdai')
legend('N.1','N.2','N.3','N.4','N.5','N.6','N.7','N.8','N.9','N.10');
subplot(122)
plot(lemda');
xlabel('迭代次数')
ylabel('lemdai')
axis([150,155,1.3,1.33]); figure;
plot(Psts');
xlabel('迭代次数')
ylabel('Pst')
legend('N.1','N.2','N.3','N.4','N.5','N.6','N.7','N.8','N.9','N.10');figure;
plot(Fc,'linewidth',2);
xlabel('迭代次数')
ylabel('供需平衡(MW)')
[Psts(:,end),a]
026_013m