In engineering and architecture, different approaches have been developed that share the use of graph transformation to automate design processes or to search for design solutions by means of computational design synthesis. In order to give an overview of these approaches, we provide a review of articles published in the last decade. Forty-eight articles were reviewed to determine similarities and differences of these approaches. Research fields in method development for the representation of design problems and the processing of graph transformations, as well as the application of graph transformations in engineering, architecture, and shape grammars were identified. Different approaches for the documentation of the vocabulary and the rules were examined. Finally, different approaches for rule applications were analyzed. Based on found limitations, future research directions are suggested.

The use of grammars in design and analysis has been set back by the lack of automated ways to induce them from arbitrarily structured datasets. Machine translation methods provide a construct for inducing grammars from coded data which have been extended to be used for design through pre-coded design data. This work introduces a four-step process for inducing grammars from un-coded structured datasets which can constitute a wide variety of data types, including many used in the design. The method includes: (1) extracting objects from the data, (2) forming structures from objects, (3) expanding structures into rules based on frequency, and (4) finding rule similarities that lead to consolidation or abstraction. To evaluate this method, grammars are induced from generated data, architectural layouts and three-dimensional design models to demonstrate that this method offers usable grammars automatically which are functionally similar to grammars produced by hand.

Shape grammars are rule-based formalisms for the specification of shape languages. Most of the existing shape grammars are developed on paper and have not been implemented computationally thus far. Nevertheless, the computer implementation of shape grammar is an important research question, not only to automate design analysis and generation, but also to extend the impact of shape grammars toward design practice and computer-aided design tools. In this paper, we investigate the implementation of shape grammars on a computer system, using a graph-theoretic representation. In particular, we describe and evaluate the implementation of the existing Rabo-de-Bacalhau transformation grammar. A practical step-by-step approach is presented, together with a discussion of important findings noticed during the implementation and evaluation. The proposed approach is shown to be both feasible and valuable in several aspects: we show how the attempt to implement a grammar on a computer system leads to a deeper understanding of that grammar, and might result in the further development of the grammar; we show how the proposed approach is embedded within a commercial computer-aided design environment to make the shape grammar formalism more accessible to students and practitioners, thereby increasing the impact of grammars on design practice; and the proposed step-by-step implementation approach has shown to be feasible for the implementation of the Rabo-de-Bacalhau transformation grammar, but can also be generalized using different ontologies for the implementation.

This paper presents a new technique for shape and topology optimization of fluid channels using generative design synthesis methods. The proposed method uses the generative abilities of graph grammars with simulation and analysis power of conventional computational fluid dynamics methods. The graph grammar interpreter GraphSynth is used to carry out graph transformations, which define different topologies for a given multiple-inlet multiple-outlet problem. After evaluating and optimizing the generated graphs, they are first transformed into meaningful three-dimensional shapes. These solutions are then analyzed by a computational fluid dynamics solver for final evaluation of the possible solutions. The effectiveness of the proposed method is checked by solving a variety of available test problems and comparing them with those found in the literature. Furthermore, by solving very complex large-scale problems, the robustness and effectiveness of the method is tested. To extend the work, future research directions are presented.

This paper deals with the system of agents treated as a concurrent modular system, which is able to support the designer in solving complex design tasks. The behavior of design agents is modeled by sets of grammar rules. Each agent manages a graph grammar and a database of facts concerning the subtask for which it is responsible. The course of designing is determined by the interaction between cooperating specialized agents. The design context is expressed by the environment in which agents act and predicates describing design criteria. The organization, design methodology, and a semantic model of a grammar-based multiagent design system are presented. The notions of a valid design solution and a design solution consistent with the design criteria are also introduced. The proposed approach is illustrated by the example of designing a house estate.

Earlier research on product family design (PFD) often highlights isolated and successful empirical studies with a limited attempt to explore the modeling and design support issues surrounding this economically important class of engineering design problems. This paper proposes a graph rewriting system to organize product family data according to the underpinning logic and to model product derivation mechanisms for PFD. It represents the structural and behavioral aspects of product families as family graphs and related graph operations, respectively. The derivation of product variants becomes a graph rewriting process, in which family graphs are transformed to variant graphs by applying appropriate graph rewriting rules. The system is developed in the language of programmed graph rewriting systems or PROGRES, which supports the specification of hierarchical graph schema and parametric rewriting rules. A meta model is defined for family graphs to factor out those entities common to all product families. A generic model is defined to describe all specific entities relevant to particular families. An instance model describes all product variants for individual customer orders. A prototype of a graph-based PFD system for office chairs is also developed. The system can provide an interactive environment for customers to make choices among product offerings. It also facilitates design automation of product families and enhances interactions and negotiations among sales, design, and manufacturing.