Rule Based Stochastic Tree Search

Kumar, Mukund; Campbell, Matthew I.; Königseder, Corinna; Shea, Kristina

doi:10.1007/978-94-017-9112-0_31

Cited by 2 publications

(2 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lienhard (2017) proposed clustering methods for building designs that make the solution space more comprehensible to a user. Campbell et al (2009) and Kumar et al (2014) propose to only generate a small set of possible solutions from a search tree. Depending on the quality of the produced designs, the later generations are optimized by updating the probabilities of decisions that led to good designs.…”

Section: Enumerative Generationmentioning

confidence: 99%

Graph Rewriting Techniques in Engineering Design

Kolbeck

Vilgertshofer

Abualdenien

et al. 2022

Front. Built Environ.

View full text Add to dashboard Cite

Capturing human knowledge underlying the design and engineering of products has been among the main goals of computational engineering since its very beginning. Over the last decades, various approaches have been proposed to tackle this objective. Among the most promising approaches is the application of graph theory for representing product structures by defining nodes representing entities and edges representing relations among them. The concrete meaning of these structures ranges from geometry representations over hierarchical product breakdowns to functional descriptions and flows of information or resources. On top of these graph structures, graph rewriting techniques provide another powerful layer of technology. By enabling the formal definition of rules for transforming graph structures, they allow on the one hand side to formally capture the engineering development process. On the other hand, the assembly of rewriting rules into graph grammars allows for an exhaustive search of the solution space of the engineering problem at hand. In combination with search strategies, an automated optimization of the design under given constraints and objectives can be realized. The paper provides an overview of the current state-of-the-art in graph rewriting and its applications in engineering design, with a focus on the built environment. It concludes with a discussion of the progress achieved and the missing research gaps.

show abstract

Section: Enumerative Generationmentioning

confidence: 99%

Graph Rewriting Techniques in Engineering Design

Kolbeck

Vilgertshofer

Abualdenien

et al. 2022

Front. Built Environ.

View full text Add to dashboard Cite

show abstract

“…In this tree, each node represents a design and the edges represent rule applications. Tree-based search methods like Breadth-First Search (BFS), Depth-First Search (DFS) or more sophisticated tree-search methods (Kumar et al 2012) can then be applied to search for desirable designs. In Figure 3, a representation of a generative search tree for the gearbox synthesis problem is given.…”

Section: Example Gearbox Synthesis Grammarmentioning

confidence: 99%

Improving design grammar development and application through network-based analysis of transition graphs

2016

Self Cite

View full text Add to dashboard Cite

Design grammars enable the formal representation of a vocabulary and rules that describe how designs can be synthesized just as the grammar rules of a spoken language define how to formulate valid, i.e., grammatically correct, sentences. Design grammars have been successfully applied in numerous engineering disciplines and enable the automated synthesis of designs within a defined design language. Design grammar development, however, is challenging and lacks methodological support. In this paper, a novel method is presented that supports the development and application of design grammars using transition graphs. In these, nodes represent generated designs and edges represent grammar rules that transform one design into another. Rather than using a tree structure to represent the possible application of rules, transition graphs are automatically generated and used to help designers better understand the developed grammar. The grammar designer is given feedback on (a) the rules, and (b) rule application sequences. This feedback can be used to (a) improve the grammar, and (b) apply it more efficiently. Two case studies, a gearbox synthesis task and a sliding tile puzzle, demonstrate the method. The results show the feasibility of the method to support design grammar development and application.

show abstract

Rule Based Stochastic Tree Search

Cited by 2 publications

References 26 publications

Graph Rewriting Techniques in Engineering Design

Graph Rewriting Techniques in Engineering Design

Improving design grammar development and application through network-based analysis of transition graphs

Contact Info

Product

Resources

About