11.12.2012 Views

Chapter 5 Robust Performance Tailoring with Tuning - SSL - MIT

Chapter 5 Robust Performance Tailoring with Tuning - SSL - MIT

Chapter 5 Robust Performance Tailoring with Tuning - SSL - MIT

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Table 5.1: Algorithm performance: RPTT, α =0.0, ∆ = 0.1.<br />

J ∗ iter fevals time x ∗ [m] y ∗ WC [kg]<br />

Alg. Form [µm] # # [min] d1 d2 m1 m2<br />

SA Eq 5.3 216.03 201 8304 5.26 0.0451 0.0388 175.63 0.0774<br />

SQP Eq 5.5 215.94 23 53 1.77 0.0451 0.0388 175.88 0.0<br />

SQP Eq 5.3 215.97 13 1001 1.62 0.0452 0.0388 175.66 0.028<br />

MC SQP Eq 5.5 215.94 414 906 31.47 0.0451 0.0388 175.90 0.0<br />

MC SQP Eq 5.3 215.94 661 5843 51.82 0.0451 0.0388 175.93 0.0<br />

Since the weighting on robustness is set to zero the optimal cost, J ∗ , is the tuned<br />

performance at the worst-case uncertainty vertex. SA provides a starting point that<br />

is very close to the optimal design after 201 temperature iterations and 8304 function<br />

evaluations. The SQP algorithm performs nicely when started at the SA design<br />

and applied to the problem of Equation 5.5. It converges to a design in only 23<br />

iterations and 53 function evaluations. In contrast, the SQP solution obtained from<br />

the formulation in Equation 5.3 is slightly sub-optimal. Note that the algorithm ran<br />

for only 13 iterations, but 1001 function evaluations. The algorithm fails to properly<br />

converge because it becomes stuck in the line search and the maximum number of<br />

function evaluations (1000) is reached. One possible reason for this behavior is that<br />

the objective function gradients required for the SQP algorithm are not well-posed<br />

for this problem. The MC SQP results are equivalent to those obtained by starting<br />

from the SA design indicating that a globally optimal design has been found. MC<br />

SQP does find the optimal design when applied to Equation 5.3 since five out of ten<br />

trials do converge successfully. The time results show that the combination of SA and<br />

SQP finds the optimal design much more quickly (7 minutes) than MC SQP (31.5<br />

minutes).<br />

5.2.2 Comparison to PT and RPT Designs<br />

The optimal tailoring parameters for the RPTT design and its performance in the<br />

nominal, and worst-case (untuned) uncertainty configurations are listed in Table 5.2<br />

along <strong>with</strong> the corresponding design variables and performances for the PT and RPT<br />

158

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!