Design of an Automatic Control Algorithm for Energy-Efficient ...
Design of an Automatic Control Algorithm for Energy-Efficient ...
Design of an Automatic Control Algorithm for Energy-Efficient ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
6 The optimiser: <strong>an</strong> evolutionary algorithm approach 66<br />
point, <strong>for</strong> example when the windscreen is fogged or iced <strong>an</strong>d c<strong>an</strong>not be defogged in the<br />
time � �������. Then solutions going in the “wrong direction” are likely to be preferred<br />
because the saturated objective is equal <strong>for</strong> all <strong>an</strong>d will be not influence the decision. In<br />
this case a solution with only little cool air blown to the feet could be chosen as control<br />
in the fogged window example. In such a case it would help to modify the predicted<br />
time sp<strong>an</strong>. That would lead to increased (<strong>an</strong>d varying!) computation time, which is not<br />
desirable. In addition, one could imagine a situation where this would lead to extreme,<br />
if not infinite periods which have to be simulated. There<strong>for</strong>e, <strong>an</strong>other method has been<br />
implemented here.<br />
Each objective has its limit assigned which has already been used <strong>for</strong> the r<strong>an</strong>king. If<br />
this limit is exceeded it is usually close to saturation or in a state where counter measures<br />
have to be taken. Thus, <strong>for</strong> each objective a special control output is defined which is<br />
aimed at helping the controller to find a way to a secure state. If several limits are exceed<br />
at a time, <strong>an</strong> ordering (�) gives <strong>an</strong> indication which to h<strong>an</strong>dle first. The weights used <strong>for</strong><br />
the r<strong>an</strong>king c<strong>an</strong> be applied <strong>for</strong> this purpose as well.<br />
h<strong>an</strong>dler.<br />
If the chosen individual is above a limit, the output will replaced with a p<strong>an</strong>ic<br />
� ������ �<br />
�<br />
��<br />
��<br />
� ������� <strong>for</strong> � ��� �������� � � � � � ������ ���<br />
� �������<br />
<strong>for</strong> � ��� �������� �� � � � � � � � ����� ���� � �� ��� �������� �� ��<br />
(6.8)<br />
This solution allows deterministic computation time since no ch<strong>an</strong>ge to the simulation is<br />
made. It also allows the control to h<strong>an</strong>dle extreme situations.<br />
6.3.11 Final thoughts on the algorithm<br />
The described methods were chosen with the in<strong>for</strong>mation found in different publications.<br />
However, the optimisation <strong>of</strong> the algorithm <strong>an</strong>d its parameters would go beyond the scope<br />
<strong>of</strong> this thesis.<br />
The main drawback <strong>of</strong> the choice <strong>of</strong> a genetic algorithm is that the quality <strong>of</strong> the<br />
found solution c<strong>an</strong>not be guar<strong>an</strong>teed, but with the introduction <strong>of</strong> the replacement signals<br />
through p<strong>an</strong>ic h<strong>an</strong>dlers safe outputs are given at each time step. The deterministic run-