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 ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
6 The optimiser: <strong>an</strong> evolutionary algorithm approach 65<br />
not. Of course this adaption is limited by <strong>an</strong> ������ <strong>an</strong>d ������. This gives a bigger (or<br />
equal) search area as long as the algorithm does not find a better solution.<br />
With the mutation operator individuals c<strong>an</strong> be shifted out <strong>of</strong> the design space. As<br />
a remedy these are simply moved back onto the boundary. This simple repair mech<strong>an</strong>ism<br />
guar<strong>an</strong>tees to have feasible individuals only.<br />
6.3.9 Replacement<br />
As replacement operator a simple truncation is applied. The children <strong>an</strong>d the parent<br />
generation are joined <strong>an</strong>d r<strong>an</strong>ked. The best ���� individuals are then tr<strong>an</strong>sferred to the<br />
next generation or the control signal <strong>an</strong>d elite selection.<br />
6.3.10 <strong>Control</strong> signal choosing<br />
Assuming that the found solutions are among the best that are available, the selection<br />
has to fulfil two goals: A solution which exceeds limits should never be applied. In such a<br />
case <strong>an</strong>other solution has to be found to provide a secure output. Secondly fast ch<strong>an</strong>ges<br />
should be avoided when being in a steady state. Even when a found solution is good a<br />
restriction is made limiting the jumps between the old <strong>an</strong>d the new set-point. This gives<br />
smoother tr<strong>an</strong>sitions <strong>an</strong>d reduces the disturb<strong>an</strong>ces through sudden ch<strong>an</strong>ges.<br />
The allowed dist<strong>an</strong>ce from the last control output is adapted with the same mech-<br />
<strong>an</strong>ism as <strong>for</strong> the mutation st<strong>an</strong>dard deviation. This allows bigger jumps when they are<br />
needed <strong>an</strong>d ch<strong>an</strong>ges are detected, <strong>an</strong>d limits them in a stationary case. With the adapted<br />
ch<strong>an</strong>ge percentage �� <strong>an</strong>d the upper <strong>an</strong>d lower limit the maximum ch<strong>an</strong>ges <strong>for</strong> each design<br />
variable is determined.<br />
������� � �� ¡ ��� ��� (6.7)<br />
If the best solution is too far away from the last control output, the second best is tried.<br />
If in the population no solution close enough to the last signal c<strong>an</strong> be found, the best is<br />
taken. In this way this mech<strong>an</strong>ism gives smooth tr<strong>an</strong>sition, if that is possible.<br />
There is a weak point in the model predictive control, namely if <strong>an</strong> objective is<br />
saturated <strong>an</strong>d the horizon is too short to find a solution going beyond that saturation