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 4.1), and the uncertainty parameters are the Young’s Moduli of the two truss<br />

arms (Table 3.1), so that the design variable vector is:<br />

x T dv =<br />

�<br />

d1 d2 m11 m12 m21 m22 m31 m32 m41 m42<br />

�<br />

(5.11)<br />

The design masses are no longer considered as tailoring parameters in this formulation<br />

since they are accounted for by the tuning component. The performance metric is the<br />

RMS of the OPD between the two collectors and is a function of all the parameters.<br />

A constraint equation limiting the total mass of the tailored and tuned system is<br />

enforced at each uncertainty vertex:<br />

⎧<br />

⎪⎨<br />

g (�x, �yi) =<br />

⎪⎩<br />

π<br />

2 ρL �2 j=1 d2j + �2 j=1 m1j − ¯ M<br />

.<br />

π<br />

2 ρL �2 j=1 d2j + �2 j=1 m4j − ¯ M<br />

∀i =1...4 (5.12)<br />

This constraint couples the tailoring and tuning parameters into the mass equation<br />

allowing the optimization algorithm to spend mass where it is most beneficial.<br />

The results presented in this section are for the case of bounded uncertainty <strong>with</strong>in<br />

±10% of the nominal uncertainty values. The weighting on robustness, α, inthe<br />

RPTT formulations is set to zero to produce a design <strong>with</strong> maximum tuning authority.<br />

5.2.1 Optimization Algorithms<br />

RPTT designs of the SCI development problem are generated by running the opti-<br />

mizations formulated in Equations 5.3 and 5.5 through the simulated annealing and<br />

sequential quadratic programming algorithms. The resulting designs are presented in<br />

Table 5.1 along <strong>with</strong> algorithm performance data. Simulated annealing is run first on<br />

the formulation in Equation 5.3 to provide an initial guess to the SQP algorithm. SA<br />

is not run <strong>with</strong> the simple minimization formulation (Equation 5.5) as it is difficult<br />

to obtain feasible guesses due to the augmented constraints. SQP is also run <strong>with</strong><br />

ten randomly-chosen initial guesses to assess the convexity of the solution space.<br />

The results show that nearly all of the SQP runs converged on the same design.<br />

157

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

Saved successfully!

Ooh no, something went wrong!