static void printProblemMA(const plan_problem_agents_t *prob)
{
int i;
printProblem(&prob->glob);
printf("Num agents: %d\n", prob->agent_size);
for (i = 0; i < prob->agent_size; ++i){
printf("Agent[%d]\n", i);
printf(" name: %s\n", prob->agent[i].agent_name);
printf(" num operators: %d\n", prob->agent[i].op_size);
printf(" projected operators: %d\n", prob->agent[i].proj_op_size);
}
fflush(stdout);
}
int
Problem::
expensiveKill()
{
int e;
if (TRACE) fprintf(outputFile,"Performing expensive kill tests: [\n");
if (DBUG) printProblem();
Problem tmpProblem;
int oldTrace = trace;
int constraintsRemoved = 0;
trace = 0;
conservative++;
for (e = nGEQs - 1; e >= 0; e--) if (!GEQs[e].essential)
{
if (DBUG)
{
fprintf(outputFile, "checking equation %d to see if it is redundant: ", e);
printGEQ(&(GEQs[e]));
fprintf(outputFile, "\n");
};
tmpProblem = *this;
tmpProblem.negateGEQ(e);
tmpProblem.varsOfInterest = 0;
tmpProblem.nSUBs = 0;
tmpProblem.nMemories = 0;
tmpProblem.safeVars = 0;
tmpProblem.variablesFreed = 0;
if (!tmpProblem.solve(FALSE))
{
constraintsRemoved++;
deleteGEQ(e);
};
};
if (constraintsRemoved)
{
if (TRACE) fprintf(outputFile,"%d Constraints removed!!\n",constraintsRemoved);
};
trace = oldTrace;
conservative--;
if (TRACE) fprintf(outputFile,"] expensive kill tests done\n");
return 1;
};
void
Problem::
quickRedKill(int computeGist)
{
int e, e2, e3, i, j, k;
coef_t a, alpha1, alpha2;
coef_t c = 0;
int isDead[maxmaxGEQs];
int deadCount = 0;
unsigned int P[maxmaxGEQs], Z[maxmaxGEQs], N[maxmaxGEQs];
unsigned int PP, PZ, PN; /* possible Positives, possible zeros & possible negatives */
unsigned int MZ; /* must zeros */
if (DBUG)
{
fprintf(outputFile, "in quickRedKill: [\n");
printProblem();
};
noteEssential(0);
int moreToDo = chainKill(1,0);
#ifdef NDEBUG
if (!moreToDo)
{
if (DBUG) fprintf(outputFile, "] quickRedKill\n");
return;
};
#endif
int equationsToKill = 0;
for (e = nGEQs - 1; e >= 0; e--)
{
int tmp = 1;
isDead[e] = 0;
P[e] = Z[e] = N[e] = 0;
if (GEQs[e].color && !GEQs[e].essential) equationsToKill++;
if (GEQs[e].color && GEQs[e].essential && !computeGist)
if (!moreToDo)
{
if (DBUG) fprintf(outputFile, "] quickRedKill\n");
return;
};
for (i = nVars; i >= 1; i--)
{
if (GEQs[e].coef[i] > 0)
P[e] |= tmp;
else if (GEQs[e].coef[i] < 0)
N[e] |= tmp;
else
Z[e] |= tmp;
tmp <<= 1;
}
}
if (!equationsToKill)
if (!moreToDo)
{
if (DBUG) fprintf(outputFile, "] quickRedKill\n");
return;
};
for (e = nGEQs - 1; e >= 0; e--)
if (!isDead[e])
for (e2 = e - 1; e2 >= 0; e2--)
if (!isDead[e2])
{
a = 0;
for (i = nVars; i > 1; i--)
{
for (j = i - 1; j > 0; j--)
{
a = (GEQs[e].coef[i] * GEQs[e2].coef[j] - GEQs[e2].coef[i] * GEQs[e].coef[j]);
if (a != 0)
goto foundPair;
};
};
continue;
foundPair:
if (DEBUG)
{
fprintf(outputFile, "found two equations to combine, i = %s, ", variable(i));
fprintf(outputFile, "j = %s, alpha = " coef_fmt "\n", variable(j), a);
printGEQ(&(GEQs[e]));
fprintf(outputFile, "\n");
printGEQ(&(GEQs[e2]));
fprintf(outputFile, "\n");
};
MZ = (Z[e] & Z[e2]);
PZ = MZ | (P[e] & N[e2]) | (N[e] & P[e2]);
PP = P[e] | P[e2];
PN = N[e] | N[e2];
for (e3 = nGEQs - 1; e3 >= 0; e3--)
if (GEQs[e3].color && !GEQs[e3].essential)
{
coef_t alpha3;
if (!implies(Z[e3], PZ) || implies(~Z[e3], MZ)) continue;
if (!implies(P[e3], PP) | !implies(N[e3], PN)) continue;
if (a > 0)
{
alpha1 = GEQs[e2].coef[j] * GEQs[e3].coef[i] - GEQs[e2].coef[i] * GEQs[e3].coef[j];
alpha2 = -(GEQs[e].coef[j] * GEQs[e3].coef[i] - GEQs[e].coef[i] * GEQs[e3].coef[j]);
alpha3 = a;
}
else
{
alpha1 = -(GEQs[e2].coef[j] * GEQs[e3].coef[i] - GEQs[e2].coef[i] * GEQs[e3].coef[j]);
alpha2 = -(-(GEQs[e].coef[j] * GEQs[e3].coef[i] - GEQs[e].coef[i] * GEQs[e3].coef[j]));
alpha3 = -a;
}
if (alpha1 > 0 && alpha2 > 0)
{
if (DEBUG)
{
fprintf(outputFile, "alpha1 = " coef_fmt ", alpha2 = " coef_fmt "; comparing against: ", alpha1, alpha2);
printGEQ(&(GEQs[e3]));
fprintf(outputFile, "\n");
};
for (k = nVars; k >= 0; k--)
{
c = alpha1 * GEQs[e].coef[k] + alpha2 * GEQs[e2].coef[k];
if (DEBUG)
{
if (k>0)
fprintf(outputFile, " %s: " coef_fmt ", " coef_fmt "\n", variable(k), c, alpha3 * GEQs[e3].coef[k]);
else fprintf(outputFile, " constant: " coef_fmt ", " coef_fmt "\n", c, alpha3 * GEQs[e3].coef[k]);
}
if (c != alpha3 * GEQs[e3].coef[k])
break;
};
if (k < 0
|| (k == 0 && c < alpha3 * (GEQs[e3].coef[k]+1)))
{
if (DEBUG)
{
deadCount++;
fprintf(outputFile, "red equation#%d is dead (%d dead so far, %d remain)\n",
e3, deadCount, nGEQs - deadCount);
printGEQ(&(GEQs[e]));
fprintf(outputFile, "\n");
printGEQ(&(GEQs[e2]));
fprintf(outputFile, "\n");
printGEQ(&(GEQs[e3]));
fprintf(outputFile, "\n");
assert(moreToDo);
};
isDead[e3] = 1;
};
};
};
};
for (e = nGEQs - 1; e >= 0; e--)
if (isDead[e])
deleteGEQ(e);
if (DBUG)
{
fprintf(outputFile,"] quickRedKill\n");
printProblem();
};
}