Conceptual level design for assembly analysis using state transitional approach

Traditionally, design for assembly is done during the detailed design phase. A designer first maps a set of design requirements into a set of components or subassemblies that can satisfy the given set of requirements. The components and subassemblies are then examined individually to determine whether they conform to the principles of design for assembly. Usually, local changes are performed so that the resultant components/subassemblies are better for assembly. In this paper, we propose to bring the design for assembly analysis into an even earlier phase-that of the conceptual design phase. We argue that by incorporating the design for assembly analysis at the conceptual design phase, we can achieve a more substantial savings as compared to the savings obtained when the design for assembly analysis is only performed as late as the detailed design phase. The basic idea is to select a combination of design concepts (previously stored in a library) such that together they can achieve the stated functional requirements (in the form of state transitional graph) at the minimum cost for assembly. This problem of selecting the right combination of design concepts is reduced to the well-known set covering problem. With this reduction, many existing graph algorithms can be applied to aid in the design for assembly analysis.

[1]  Michael N. Huhns,et al.  Argo: an analogical reasoning system for solving design problems , 1992 .

[2]  Katia P. Sycara,et al.  Index Transformation Techniques for Facilitating Creative Use of Multiple Cases , 1991, IJCAI.

[3]  Shinsuke Akagi Artificial intelligence in engineering design. , 1989 .

[4]  R. Light,et al.  Modification of geometric models through variational geometry , 1982 .

[5]  Cornelius T. Leondes,et al.  Constraint Theory, Part I: Fundamentals , 1969, IEEE Trans. Syst. Sci. Cybern..

[6]  Bernd Voigt,et al.  Finding Minimally Weighted Subgraphs , 1991, WG.

[7]  David Eppstein,et al.  The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, GD.

[8]  Cornelius T. Leondes,et al.  Constraint Theory, Part III: Inequality and Discrete Relations , 1969, IEEE Trans. Syst. Sci. Cybern..

[9]  Edward K. Baker,et al.  Efficient heuristic algorithms for the weighted set covering problem , 1981, Comput. Oper. Res..

[10]  Jack Mostow,et al.  Automated reuse of design plans , 1989, Artif. Intell. Eng..

[11]  A. H. Redford,et al.  Design for Assembly , 1983, Methods and Tools for Computer Integrated Manufacturing.

[12]  Katia P. Sycara,et al.  Representing and indexing design cases , 1989, IEA/AIE '89.

[13]  G. Boothroyd,et al.  Design for assembly , 1993, IEEE Spectrum.

[14]  James Arthur Gosling,et al.  Algebraic constraints , 1983 .

[15]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..