Adjacency structures as mappings between function and structure in discrete static systems

One view of the design process is that design is a mapping from functional requirements to artifact description. This article presents initial work on a method for mapping between functional requirements and a description of the physical structure of discrete static systems. The representation consists of a set of atomic elements, a hierarchy of compound components from the domain, and the composition of a graph of adjacent atomic elements. Through forward or backward chaining, this method may be used in a parsing mode to discover the behavior and function of a given system, or in a generative mode to suggest instances of systems which can be used to satisfy the desired functionality. Parsing discovers the behavior of the system in terms of the compound components by matching on subgraphs within the overall adjacency graph. Generation hierarchically instantiates subgraphs which satisfy the initial functional requirements and the requirements propagated by previously instantiated components. The graph is composed from a geometric model, but the method is independent of the specific representation used by the geometric modeler. We focus on the domain of structural systems in buildings to describe this method. This work has been sponsored by EDRC, the Engineering Design Research Center at Carnegie Mellon University, an NSF-sponsorcd Engineering Research Center.

[1]  Hans Jürgen Schneider Syntax-Directed Description of Incremental Compilers , 1974, GI Jahrestagung.

[2]  Manfred Nagl,et al.  Graph-Grammars and Their Application to Computer Science , 1982, Lecture Notes in Computer Science.

[3]  James R. Rinderle,et al.  A transformational approach to mechanical design using a bond graph grammer , 1990 .

[4]  John S. Gero,et al.  Behaviour: A link between function and structure in design , 1992 .

[5]  Manfred Schnitzler,et al.  The isomorphism problem is polynomially solvable for certain graph languages , 1982, Graph-Grammars and Their Application to Computer Science.

[6]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[7]  Ulrich Flemming,et al.  A generative expert system for the design of building layouts : version 2 , 1988 .

[8]  W. Mitchell,et al.  Synthesis and Optimization of Small Rectangular Floor Plans , 1976 .

[9]  Dean Karnopp,et al.  Analysis and simulation of multiport systems : the bond graph approach to physical system dynamics , 1968 .

[10]  U Flemming,et al.  More on the Representation and Generation of Loosely Packed Arrangements of Rectangles , 1986 .

[11]  G. Stiny A Note on the Description of Designs , 1981 .

[12]  Manfred Nagl Set theoretic approaches to graph grammars , 1986, Graph-Grammars and Their Application to Computer Science.

[13]  Pierre Deransart,et al.  Attribute Grammars: Definitions, Systems and Bibliography , 1988 .

[14]  John S. Gero,et al.  Design Prototypes: A Knowledge Representation Schema for Design , 1990, AI Mag..

[15]  U. Flemming,et al.  A Generative Expert System for the Design of Building Layouts , 1986 .

[16]  James R. Rinderle Grammatical approaches to engineering design, part II: Melding configuration and parametric design using attribute grammars , 1991 .

[17]  Grzegorz Rozenberg An introduction to the NLC way of rewriting graphs , 1986, Graph-Grammars and Their Application to Computer Science.

[18]  A. H. Bond,et al.  A formal approach for product model information , 1991 .

[19]  R Krishnamurti,et al.  Algorithmic Aspects of Plan Generation and Enumeration , 1978 .

[20]  Hans Jürgen Schneider,et al.  Syntax-Directed Description of Incremental Compilers , 1974, GI Jahrestagung.

[21]  John S. Gero,et al.  Chunking Structural Design Knowledge as Prototypes , 1989 .

[22]  Luis Alberto Pineda Cortes Graflog: a theory of semantics for graphics with applications to human-computer interaction and cad systems , 1989 .