很难找的基于模糊控制的程序源代码10页.doc

会员专享推荐 · 你可能也用得上更多

开通会员，畅读全站文档

本篇文档已为你保留

本篇文档价值 ~~¥35.00~~会员免费解锁

全文不限次阅读，剩余内容即刻解锁
高速下载通道，免排队、无等待
专属客服 1 对 1 答疑，优先响应
每日赠送下载券，本篇文档免费送

有 86 篇商业计划书正在上传

下载原文档

#include<iostream.h>#include<iomanip.h>#include<fstream.h>#include<stdlib.h>structFzb{intyyz;//语言之intly;//论域floatlsd;//隶属值structFzb*next;};classFuzzy{private:intg[49][3];//定义了规则库，用于函数间调用floatR[169][13];//定义了关系矩阵，用于函数间调用floatH[13][13];//定义了查询表矩阵，用于函数间的调用public:structFzb*Creatfzb();//建立赋值表函数voidPrintfzb(structFzb*head1);//输出赋值表voidInputgzk();//导入规则库voidjlgx(structFzb*E,structFzb*EC,structFzb*U);//建立关系矩阵voidjlcxb(structFzb*E,structFzb*EC,structFzb*U);//建立查询表};structFzb*Fuzzy::Creatfzb(){floatf[8][14]={{0,-6,-5,-4,-3,-2,-1,0,1,2,3,4,5,6},{-3,1,0.5,0,0,0,0,0,0,0,0,0,0,0},{-2,0,0.5,1,0.5,0,0,0,0,0,0,0,0,0},{-1,0,0,0,0.5,1,0.5,0,0,0,0,0,0,0},{0,0,0,0,0,0,0.5,1,0.5,0,0,0,0,0},{1,0,0,0,0,0,0,0,0.5,1,0.5,0,0,0},{2,0,0,0,0,0,0,0,0,0,0.5,1,0.5,0},{3,0,0,0,0,0,0,0,0,0,0,0,0.5,1}};//默认输入赋值表inti,k,j;fstreamin,out;structFzb*head,*p1,*p2;intn=0;head=NULL;p1=new(Fzb);for(k=1;k<8;k++)for(j=1;j<14;j++){n++;p1->lsd=f[k][j];p1->yyz=(int)f[k][0];p1->ly=(int)f[0][j];if(1==n)head=p1;p2=p1;p1=new(Fzb);p2->next=p1;}p2->next=NULL;int m=0;return(head);}voidFuzzy::Inputgzk(){intG[49][3]={{-3,-3,-3},{-3,-2,-3},{-3,-1,-3},{-3,0,-3},{-3,1,-2},{-3,2,0},{-3,3,0},{-2,-3,-3},{-2,-2,-3},{-2,-1,-3},{-2,0,-3},{-2,1,-2},{-2,2,0},{-2,3,0},{-1,-3,-2},{-1,-2,-2},{-1,-1,-2},{-1,0,-2},{-1,1,0},{-1,2,1},{-1,3,1},{0,-3,-2},{0,-2,-2},{0,-1,-1},{0,0,0},{0,1,1},{0,2,2},{0,3,2},{1,-3,-1},{1,-2,-1},{1,-1,0},{1,0,2},{1,1,2},{1,2,2},{1,3,2},{2,-3,0},{2,-2,0},{2,-1,2},{2,0,3},{2,1,3},{2,2,3},{2,3,3},{3,-3,0},{3,-2,0},{3,-1,2},{3,0,3},{3,1,3},{3,2,3},{3,3,3}};//默认输入规则库inti,j;intn=0;for(i=0;i<49;i++)for(j=0;j<3;j++){n++;g[i][j]=G[i][j];cout<<setw(5)<<g[i][j];//显示规则库if(3==n){cout<<endl;n=0;}}}voidFuzzy::Printfzb(structFzb*head1){structFzb*p;p=head1;intn,i,j;floata[8][14];while(NULL!=p){a[p->yyz+4][p->ly+7]=p->lsd;p=p->next;}p=head1;while(NULL!=p){a[0][p->ly+7]=p->ly;p=p->next;}p=head1;while(NULL!=p){a[p->yyz+4][0]=p->yyz;p=p->next;}a[0][0]=0;intk;for(i=0;i<8;i++)//用于输出标准形式的赋值表{n=0;for(j=0;j<14;j++){n++;if(0==j&&0!=i){switch((int)a[i][j]){case-3:cout<<setw(5)<<"NB";break;case-2:cout<<setw(5)<<"NM";break;case-1:cout<<setw(5)<<"NS";break;case0:cout<<setw(5)<<"Z";break;case1:cout<<setw(5)<<"PS";break;case2:cout<<setw(5)<<"PM";break;case3:cout<<setw(5)<<"PB";}}elsecout<<setw(5)<<a[i][j];if(14==n)cout<<endl;}}}voidFuzzy::jlgx(structFzb*E,structFzb*EC,structFzb*U){inti,j,k,m,n,l,z;structFzb*p1,*p2,*p3;p1=E;p2=EC;p3=U;floata[13],b[13],c[13];floatR1[169],R2[169][13];//前者用于存储转置后的一维向量，后者用于暂时存储每条规则生成的关系矩阵for(i=0;i<49;i++){p1=E;p2=EC;p3=U;k=0;m=0;n=0;z=0;while(NULL!=p1){if(p1->yyz==g[i][0])a[k++]=p1->lsd;p1=p1->next;}while(NULL!=p2){if(p2->yyz==g[i][1])b[m++]=p2->lsd;p2=p2->next;}while(NULL!=p3){if(p3->yyz==g[i][2])c[n++]=p3->lsd;p3=p3->next;}for(j=0;j<13;j++)for(l=0;l<13;l++){if(a[j]>b[l])R1[z++]=b[l];elseR1[z++]=a[j];}for(j=0;j<169;j++)for(l=0;l<13;l++){if(R1[j]>c[l])R2[j][l]=c[l];elseR2[j][l]=R1[j];}if(0==i)for(j=0;j<169;j++)//以下于对所有规则对应的关系矩阵作加法for(l=0;l<13;l++){R[j][l]=R2[j][l];}for(j=0;j<169;j++)for(l=0;l<13;l++){if(R2[j][l]>R[j][l])R[j][l]=R2[j][l];}}i=0;for(j=0;j<169;j++)for(l=0;l<13;l++){i++;cout<<setw(5)<<R[j][l];//输出总的关系矩if(13==i){cout<<endl;i=0;}}return;}voidFuzzy::jlcxb(structFzb*E,structFzb*EC,structFzb*U){inte,ec,u;inti,j,k,n=0,l=0,x=0;floatm=0;structFzb*p1,*p2,*p3;p1=E;p2=EC;p3=U;floata[13],b[13];floatgg[169];floatmax=0,min;floatt[13];//用于存储每次生成的U的隶属函数，从而求得每组e,ec对应的ufor(i=0;i<13;i++)for(j=0;j<13;j++){m=0;p1=E;p2=EC;p3=U;l=0;e=i-6;ec=j-6;while(NULL!=p1){if(e<0){if(e==p1->ly&&m<p1->lsd){n=p1->yyz;m=p1->lsd;}}else{if(e==p1->ly&&m<=p1->lsd){n=p1->yyz;m=p1->lsd;}}p1=p1->next;}p1=E;while(NULL!=p1){if(n==p1->yyz)a[l++]=p1->lsd;p1=p1->next;}m=0;while(NULL!=p2){if(ec<0){if(ec==p2->ly&&m<p2->lsd){n=p2->yyz;m=p2->lsd;}}else{if(ec==p2->ly&&m<=p2->lsd){n=p2->yyz;m=p2->lsd;}}p2=p2->next;}p2=EC;l=0;while(NULL!=p2){if(n==p2->yyz)b[l++]=p2->lsd;p2=p2->next;}/*cout<<e<<""<<ec<<endl;for(x=0;x<13;x++){cout<<a[x]<<"";}cout<<endl;for(x=0;x<13;x++){cout<<b[x]<<"";}cout<<endl;*/n=0;for(x=0;x<13;x++)for(l=0;l<13;l++){if(a[x]<b[l])gg[n++]=a[x];elsegg[n++]=b[l];}for(x=0;x<13;x++)//进行推理合成规则计算{max=0;for(l=0;l<169;l++)。