📄 sffisold.c
字号:
/*
for (i = 0; i < fis->in_n; i++) {
printf("Input variable %d = %s\n", i+1, fis->input[i]->name);
for (j = 0; j < fis->input[i]->mf_n; j++)
printf("\t Label for MF %d = %s\n", j+1, fis->input[i]->mf[j]->label);
}
for (i = 0; i < fis->out_n; i++) {
printf("Output variable %d = %s\n", i+1, fis->output[i]->name);
for (j = 0; j < fis->output[i]->mf_n; j++)
printf("\t Label for MF %d = %s\n", j+1, fis->output[i]->mf[j]->label);
}
*/
for (i = 0; i < fis->in_n; i++)
printf("Bounds for input variable %d: [%6.3f %6.3f]\n", i+1,
fis->input[i]->bound[0], fis->input[i]->bound[1]);
for (i = 0; i < fis->out_n; i++)
printf("Bounds for output variable %d: [%6.3f %6.3f]\n", i+1,
fis->output[i]->bound[0], fis->output[i]->bound[1]);
for (i = 0; i < fis->in_n; i++) {
printf("MF for input variable %d (%s):\n", i+1, fis->input[i]->name);
for (j = 0; j < fis->input[i]->mf_n; j++)
printf("\t Type for MF %d = %s\n", j+1, fis->input[i]->mf[j]->type);
}
for (i = 0; i < fis->out_n; i++) {
printf("MF for output variable %d (%s):\n", i+1, fis->output[i]->name);
for (j = 0; j < fis->output[i]->mf_n; j++)
printf("\t Type for MF %d = %s\n", j+1, fis->output[i]->mf[j]->type);
}
printf("Rule list:\n");
for (i = 0; i < fis->rule_n; i++) {
for (j = 0; j < fis->in_n + fis->out_n; j++)
printf("%d ", fis->rule_list[i][j]);
printf("\n");
}
printf("Rule weights:\n");
for (i = 0; i < fis->rule_n; i++)
printf("%f\n", fis->rule_weight[i]);
printf("AND-OR indicator:\n");
for (i = 0; i < fis->rule_n; i++)
printf("%d\n", fis->and_or[i]);
for (i = 0; i < fis->in_n; i++) {
printf("MF parameters for input variable %d (%s):\n",
i+1, fis->input[i]->name);
for (j = 0; j < fis->input[i]->mf_n; j++) {
printf("\tParameters for MF %d (%s) (%s): ",
j+1, fis->input[i]->mf[j]->label,
fis->input[i]->mf[j]->type);
for (k = 0; k < MF_PARA_N; k++)
printf("%6.3f ", fis->input[i]->mf[j]->para[k]);
printf("\n");
}
}
if (strcmp(fis->type, "mamdani") == 0) {
for (i = 0; i < fis->out_n; i++) {
printf("MF parameters for output variable %d (%s):\n",
i+1, fis->output[i]->name);
for (j = 0; j < fis->output[i]->mf_n; j++) {
printf("\tParameters for MF %d (%s) (%s): ",
j+1, fis->output[i]->mf[j]->label,
fis->output[i]->mf[j]->type);
for (k = 0; k < MF_PARA_N; k++)
printf("%6.3f ", fis->output[i]->mf[j]->para[k]);
printf("\n");
}
}
} else if (strcmp(fis->type, "sugeno") == 0) {
for (i = 0; i < fis->out_n; i++) {
printf("Sugeno model parameters for output variable %d (%s):\n",
i+1, fis->output[i]->name);
for (j = 0; j < fis->output[i]->mf_n; j++) {
printf("\tSugeno model parameters for list %d (%s) (%s): ",
j+1, fis->output[i]->mf[j]->label,
fis->output[i]->mf[j]->type);
for (k = 0; k < fis->in_n + 1; k++)
printf("%6.3f ", fis->output[i]->mf[j]->sugeno_coef[k]);
printf("\n");
}
}
} else {
printf("fis->type = %s\n", fis->type);
fisError("Unknown fis type!");
}
}
#endif
static void
#ifdef __STDC__
fisFreeMfList(MF *mf_list, int n)
#else
fisFreeMfList(mf_list, n)
MF *mf_list;
int n;
#endif
{
int i;
for (i = 0; i < n; i++) {
free(mf_list[i].sugeno_coef);
free(mf_list[i].value_array);
}
free(mf_list);
}
static void
#ifdef __STDC__
fisFreeIoList(IO *io_list, int n)
#else
fisFreeIoList(io_list, n)
IO *io_list;
int n;
#endif
{
int i;
for (i = 0; i < n; i++) {
if (io_list[i].mf_n > 0) /* check if no MF at all */
fisFreeMfList(io_list[i].mf[0], io_list[i].mf_n);
free(io_list[i].mf);
}
free(io_list);
}
void
#ifdef __STDC__
fisFreeFisNode(FIS *fis)
#else
fisFreeFisNode(fis)
FIS *fis;
#endif
{
if (fis == NULL)
return;
fisFreeIoList(fis->input[0], fis->in_n);
free(fis->input);
fisFreeIoList(fis->output[0], fis->out_n);
free(fis->output);
#ifdef FREEMAT
FREEMAT((void **)fis->rule_list, fis->rule_n);
#else
fisFreeMatrix((void **)fis->rule_list, fis->rule_n);
#endif
free(fis->rule_weight);
free(fis->and_or);
free(fis->firing_strength);
free(fis->rule_output);
free(fis->BigOutMfMatrix);
free(fis->BigWeightMatrix);
free(fis->mfs_of_rule);
free(fis);
}
/* Compute arrays of MF values (for Mamdani model only) */
/* This is done whenever new parameters are loaded */
void
#ifdef __STDC__
fisComputeOutputMfValueArray(FIS *fis, int numofpoints)
#else
fisComputeOutputMfValueArray(fis)
FIS *fis;
int numofpoints
#endif
{
int i, j, k;
double x, lx, ux, dx;
MF *mf_node;
for (i = 0; i < fis->out_n; i++) {
lx = fis->output[i]->bound[0];
ux = fis->output[i]->bound[1];
dx = (ux - lx)/(numofpoints - 1);
for (j = 0; j < fis->output[i]->mf_n; j++) {
mf_node = fis->output[i]->mf[j];
if (!mf_node->userDefined)
for (k = 0; k < numofpoints; k++) {
x = lx + k*dx;
mf_node->value_array[k] =
(*mf_node->mfFcn)(x, mf_node->para);
}
else { /* user defined MF */
#ifdef MATLAB_MEX_FILE
/* this is non-vector version */
/*
for (k = 0; k < numofpoints; k++) {
x = lx + k*dx;
mf_node->value_array[k] =
fisCallMatlabMf(x, mf_node->para,
mf_node->type);
}
*/
/* this is vector version */
{
double *X;
X = (double *)calloc(numofpoints, sizeof(double));
/* double X[numofpoints]; */
for (k = 0; k < numofpoints; k++)
X[k] = lx + k*dx;
fisCallMatlabMf2(X, mf_node->para,
mf_node->type, numofpoints, mf_node->value_array);
free(X);
}
#else
#ifndef NO_PRINTF
printf("Cannot find MF type %s!\n", mf_node->type);
#endif
fisError("Exiting ...");
#endif
}
}
}
}
/* Copyright (c) 1994-98 by The MathWorks, Inc. */
/* $Revision: $ $Date: $ */
/* copy string (the first 'length' characters) from array to target string */
static void
#ifdef __STDC__
fisGetString2(char *target, double *array, int max_leng)
#else
fisGetString2(target, array, max_leng)
char *target;
double *array;
int max_leng;
#endif
{
int i;
int actual_leng;
/* Find the actual length of the string */
/* If the string is not ended with 0, take max_leng */
for (actual_leng = 0; actual_leng < max_leng; actual_leng++)
if (array[actual_leng] == 0)
break;
if (actual_leng + 1 > STR_LEN) {
#ifndef NO_PRINTF
printf("actual_leng = %d\n", actual_leng);
printf("STR_LEN = %d\n", STR_LEN);
#endif
fisError("String too long!");
}
for (i = 0; i < actual_leng; i++)
target[i] = (int)array[i];
target[actual_leng] = 0;
}
/* Check if there are abnormal situations is the FIS data structure */
/* Things being checked:
1. MF indices out of bound.
2. Rules with no premise part.
3. Sugeno system with negated consequent.
4. Sugeno system with zero consequent.
*/
void
#ifdef __STDC__
fisCheckDataStructure(FIS *fis)
#else
fisCheckDataStructure(fis)
FIS *fis;
#endif
{
int i, j, mf_index;
int found;
/* check if MF indices are out of bound */
for (i = 0; i < fis->rule_n; i++) {
for (j = 0; j < fis->in_n; j++) {
mf_index = fis->rule_list[i][j];
if (ABS(mf_index) > fis->input[j]->mf_n) {
#ifndef NO_PRINTF
printf("MF index for input %d in rule %d is out of bound.\n",
j+1, i+1);
#endif
fisFreeFisNode(fis);
fisError("Exiting ...");
}
}
for (j = 0; j < fis->out_n; j++) {
mf_index = fis->rule_list[i][fis->in_n+j];
if (ABS(mf_index) > fis->output[j]->mf_n) {
#ifndef NO_PRINTF
printf("MF index for output %d in rule %d is out of bound.\n",
j+1, i+1);
#endif
fisFreeFisNode(fis);
fisError("Exiting ...");
}
}
}
/* check if there is a rule whose premise MF indice are all zeros */
for (i = 0; i < fis->rule_n; i++) {
found = 1;
for (j = 0; j < fis->in_n; j++) {
mf_index = fis->rule_list[i][j];
if (mf_index != 0) {
found = 0;
break;
}
}
if (found == 1) {
#ifndef NO_PRINTF
printf("Rule %d has no premise part.\n", i+1);
#endif
fisFreeFisNode(fis);
fisError("Exiting ...");
}
}
/* check if it's sugeno system with "NOT" consequent */
if (strcmp(fis->type, "sugeno") == 0)
for (i = 0; i < fis->rule_n; i++)
for (j = 0; j < fis->out_n; j++) {
mf_index = fis->rule_list[i][fis->in_n+j];
if (mf_index < 0) {
#ifndef NO_PRINTF
printf("Rule %d has a 'NOT' consequent.\n", i+1);
printf("Sugeno fuzzy inference system does not allow this.\n");
#endif
fisError("Exiting ...");
}
}
/* check if it's sugeno system with zero consequent */
if (strcmp(fis->type, "sugeno") == 0)
for (i = 0; i < fis->rule_n; i++)
for (j = 0; j < fis->out_n; j++) {
mf_index = fis->rule_list[i][fis->in_n+j];
if (mf_index == 0) {
#ifndef NO_PRINTF
printf("\nWarning: Output %d in rule %d has a zero MF index.\n", j+1, i+1);
printf("This output in the rule is assumed zero in subsequent calculation.\n\n");
#endif
}
}
}
/* Build FIS node and load parameter from fismatrix directly */
/* col_n is the number of columns of the fismatrix */
static void
#ifdef __STDC__
fisBuildFisNode(FIS *fis, double **fismatrix, int col_n, int numofpoints)
#else
fisBuildFisNode(fis, fismatrix, col_n)
FIS *fis;
double **fismatrix;
int col_n;
int numofpoints;
#endif
{
int i, j, k;
int *in_mf_n, *out_mf_n;
IO *io_list;
int start;
fisGetString2(fis->name, fismatrix[0], col_n);
fisGetString2(fis->type, fismatrix[1], col_n);
fis->in_n = fismatrix[2][0];
fis->out_n = fismatrix[2][1];
/* create input node list */
in_mf_n = (int *)calloc(fis->in_n, sizeof(int));
for (i = 0; i < fis->in_n; i++)
in_mf_n[i] = fismatrix[3][i];
io_list = fisBuildIoList(fis->in_n, in_mf_n);
free(in_mf_n);
fis->input = (IO **)calloc(fis->in_n, sizeof(IO *));
for (i = 0; i < fis->in_n; i++)
fis->input[i] = io_list+i;
/* create output node list */
out_mf_n = (int *)calloc(fis->out_n, sizeof(int));
for (i = 0; i < fis->out_n; i++)
out_mf_n[i] = fismatrix[4][i];
io_list = fisBuildIoList(fis->out_n, out_mf_n);
free(out_mf_n);
fis->output = (IO **)calloc(fis->out_n, sizeof(IO *));
for (i = 0; i < fis->out_n; i++)
fis->output[i] = io_list+i;
fis->rule_n = fismatrix[5][0];
fisGetString2(fis->andMethod, fismatrix[6], col_n);
fisGetString2(fis->orMethod, fismatrix[7], col_n);
fisGetString2(fis->impMethod, fismatrix[8], col_n);
fisGetString2(fis->aggMethod, fismatrix[9], col_n);
fisGetString2(fis->defuzzMethod, fismatrix[10], col_n);
start = 11;
/* For efficiency, I/O names and MF labels are not stored */
for (i = 0; i < fis->in_n; i++) {
fis->input[i]->name[0] = '\0';
for (j = 0; j < fis->input[i]->mf_n; j++)
fis->input[i]->mf[j]->label[0] = '\0';
}
for (i = 0; i < fis->out_n; i++) {
fis->output[i]->name[0] = '\0';
for (j = 0; j < fis->output[i]->mf_n; j++)
fis->output[i]->mf[j]->label[0] = '\0';
}
start = start + fis->in_n + fis->out_n;
for (i = start; i < start + fis->in_n; i++) {
fis->input[i-start]->bound[0] = fismatrix[i][0];
fis->input[i-start]->bound[1] = fismatrix[i][1];
}
start = start + fis->in_n;
for (i = start; i < start + fis->out_n; i++) {
fis->output[i-start]->bound[0] = fismatrix[i][0];
fis->output[i-start]->bound[1] = fismatrix[i][1];
}
/* update "start" to skip reading of MF labels */
for (i = 0; i < fis->in_n; start += fis->input[i]->mf_n, i++);
for (i = 0; i < fis->out_n; start += fis->output[i]->mf_n, i++);
start = start + fis->out_n;
for (i = 0; i < fis->in_n; i++)
for (j = 0; j < fis->input[i]->mf_n; j++) {
fisGetString2(fis->input[i]->mf[j]->type, fismatrix[start], col_n);
start++;
}
for (i = 0; i < fis->out_n; i++)
for (j = 0; j < fis->output[i]->mf_n; j++) {
fisGetString2(fis->output[i]->mf[j]->type, fismatrix[start], col_n);
start++;
}
fisAssignMfPointer(fis);
fisAssignFunctionPointer(fis);
/* get input MF parameters */
for (i = 0; i < fis->in_n; i++) {
for (j = 0; j < fis->input[i]->mf_n; j++) {
for (k = 0; k < MF_PARA_N; k++)
fis->input[i]->mf[j]->para[k] =
fismatrix[start][k];
start++;
}
}
/* get Mamdani output MF parameters and compute MF value array */
if (strcmp(fis->type, "mamdani") == 0) {
for (i = 0; i < fis->out_n; i++)
for (j = 0; j < fis->output[i]->mf_n; j++) {
fis->output[i]->mf[j]->value_array =
(double *)calloc(numofpoints, sizeof(double));
for (k = 0; k < MF_PARA_N; k++)
fis->output[i]->mf[j]->para[k] =
fismatrix[start][k];
start++;
}
fisComputeOutputMfValueArray(fis, numofpoints);
/* get Sugeno output equation parameters */
} else if (strcmp(fis->type, "sugeno") == 0) {
for (i = 0; i < fis->out_n; i++)
for (j = 0; j < fis->output[i]->mf_n; j++) {
fis->output[i]->mf[j]->sugeno_coef =
(double *)calloc(fis->in_n+1, sizeof(double));
for (k = 0; k < fis->in_n+1; k++)
fis->output[i]->mf[j]->sugeno_coef[k] =
fismatrix[start][k];
start++;
}
} else {
#ifndef NO_PRINTF
printf("fis->type = %s\n", fis->type);
#endif
fisError("Unknown fis type!");
}
fis->rule_list = (int **)fisCreateMatrix
(fis->rule_n, fis->in_n + fis->out_n, sizeof(int));
fis->rule_weight = (double *)calloc(fis->rule_n, sizeof(double));
fis->and_or = (int *)calloc(fis->rule_n, sizeof(int));
for (i = 0; i < fis->rule_n; i++) {
for (j = 0; j < fis->in_n + fis->out_n; j++)
fis->rule_list[i][j] = (int)fismatrix[start][j];
fis->rule_weight[i] = fismatrix[start][fis->in_n+fis->out_n];
fis->and_or[i] = (int)fismatrix[start][fis->in_n+fis->out_n+1];
start++;
}
fis->firing_strength = (double *)calloc(fis->rule_n, sizeof(double));
fis->rule_output = (double *)calloc(fis->rule_n, sizeof(double));
if (strcmp(fis->type, "mamdani") == 0) {
fis->BigOutMfMatrix = (double *)
calloc(fis->rule_n*numofpoints, sizeof(double));
fis->BigWeightMatrix = (double *)
calloc(fis->rule_n*numofpoints, sizeof(double));
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -