Research Papers

Design Optimization Problem Reformulation Using Singular Value Decomposition

[+] Author and Article Information
Somwrita Sarkar

Faculty of Architecture, Design and Planning, University of Sydney, Australiassar3264@mail.usyd.edu.au

Andy Dong

Faculty of Architecture, Design and Planning, University of Sydney, Australiaandy@arch.usyd.edu.au

John S. Gero

Krasnow Institute for Advanced Study,George Mason Universityjohn@johngero.com

J. Mech. Des 131(8), 081006 (Jul 20, 2009) (10 pages) doi:10.1115/1.3179148 History: Received September 24, 2008; Revised May 21, 2009; Published July 20, 2009

This paper presents a design optimization problem reformulation method based on singular value decomposition, dimensionality reduction, and unsupervised clustering. The method calculates linear approximations of associative patterns of symbol co-occurrences in a design problem representation to induce implicit coupling strengths between variables and constraints. Unsupervised clustering of these approximations is used to heuristically identify useful reformulations. In contrast to knowledge-rich Artificial Intelligence methods, this method derives from a knowledge-lean, unsupervised pattern recognition perspective. We explain the method on an analytically formulated decomposition problem, and apply it to various analytic and nonanalytic problem forms to demonstrate design decomposition and design “case” identification. A single method is used to demonstrate multiple design reformulation tasks. The results show that the method can be used to infer multiple well-formed reformulations starting from a single problem representation in a knowledge-lean manner.

Copyright © 2009 by American Society of Mechanical Engineers
Your Session has timed out. Please sign back in to continue.



Grahic Jump Location
Figure 3

Truncated SVD with retained k=2 for A

Grahic Jump Location
Figure 4

Increasing k changes variable-function relationships

Grahic Jump Location
Figure 5

Variable-function relationships in k=2 approximation

Grahic Jump Location
Figure 1

(a) Example problem, and (b) occurrence matrix A

Grahic Jump Location
Figure 2

SVD analysis of A

Grahic Jump Location
Figure 6

Cosines between x1 and functions

Grahic Jump Location
Figure 7

Problem decomposition by K-means algorithm

Grahic Jump Location
Figure 8

The HCD problem statement

Grahic Jump Location
Figure 9

(a) k=2 approximation for HCD problem, (b) high positive cosines (k=2) between functions gives the links between functions in (a), and (c) multi-objective hydraulic cylinder problem graph

Grahic Jump Location
Figure 10

(a) FDT problem and (b) solution, and (c) DSM problem and (d) solution

Grahic Jump Location
Figure 11

Decomposition results for FDT problem

Grahic Jump Location
Figure 12

Decomposition results for DSM problem

Grahic Jump Location
Figure 13

(a) The ACS problem, (b) design variables and states; (c) and (d) occurrence matrices

Grahic Jump Location
Figure 14

Correct, extra, and missed cases for k=2,3,4

Grahic Jump Location
Figure 15

(a) Precision and (b) recall measurements



Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In