Automatically Transforming Object-Oriented Graph-Based Representations Into Boolean Satisfiability Problems for Computational Design Synthesis

2013 ◽  
Vol 135 (10) ◽  
Author(s):  
Clemens Münzer ◽  
Bergen Helms ◽  
Kristina Shea

Ever since computers have been used to support human designers, a variety of representations have been used to encapsulate engineering knowledge. Computational design synthesis (CDS) approaches utilize this knowledge to generate design candidates for a specified task. However, new approaches are required to enable systematic solution space exploration. This paper presents an approach that combines a graph-based object-oriented knowledge representation with first-order logic and Boolean satisfiability. This combination is used as the foundation for a generic automated approach for requirement-driven computational design synthesis. Available design building blocks and a design task defined through a set of requirements are modeled in a graph-based environment and then automatically transferred into a Boolean satisfiability problem and solved, considering a given solution size. The Boolean solution is automatically transferred back to the graph-based domain. The method is validated through two case studies: synthesis of automotive powertrains and chemical process synthesis for ethyl alcohol production. The contribution of the paper is a new method that is able to determine if an engineering task is solvable for a given set of synthesis building blocks and enables systematic solution space exploration.

Author(s):  
Clemens Münzer ◽  
Kristina Shea ◽  
Bergen Helms

Ever since computers have been used to support human designers, a variety of representations have been used to encapsulate engineering knowledge. Computational design synthesis approaches utilize this knowledge to generate design candidates for a specified task. However, new approaches are required to enable systematic solution space exploration. This paper presents an approach that combines a graph-based, object-oriented knowledge representation with first-order logic and Boolean satisfiability. This combination is used as the foundation for a generic, automated approach for requirement-driven computational design synthesis. Available design building blocks and a design task defined through a set of requirements are modeled in a graph-based environment and then automatically transferred into a Boolean satisfiability problem and solved, considering a given solution size. The solution is then automatically transferred back to the graph-based domain. The method is validated through the synthesis of automotive powertrains. The contribution of the paper is a new method that is both able to determine that an engineering task is solvable or not given a set of design building blocks and able to systematically explore the solution space.


Author(s):  
Corinna Königseder ◽  
Kristina Shea

Design grammars have been successfully applied in numerous engineering disciplines, e.g. in electrical engineering, architecture and mechanical engineering. A successful application of design grammars in Computational Design Synthesis (CDS) requires a) a meaningful representation of designs and the design task at hand, b) a careful formulation of grammar rules to synthesize new designs, c) problem specific design evaluations, and d) the selection of an appropriate algorithm to guide the synthesis process. Managing these different aspects of CDS requires not only a detailed understanding of each individual part, but also of the interdependencies between them. In this paper, a new method is presented to analyze the exploration of design spaces in CDS. The method analyzes the designs generated during the synthesis process and visualizes how the design space is explored with respect to a) design characteristics, and b) objectives. The selected algorithm as well as the grammar rules can be analyzed with this approach to support the human designer in successfully understanding and applying a CDS method. The case study demonstrates how the method is used to analyze the synthesis of bicycle frames. Two algorithms are compared for this task. Results demonstrate how the method increases the understanding of the different components in CDS. The presented research can be useful for both novices to CDS to help them gain a deeper understanding of the interplay between grammar rules and guidance of the synthesis process, as well as for experts aiming to further improve their CDS application by improving parameter settings of their search algorithms, or by further refining their design grammar. Additionally, the presented method constitutes a novel approach to interactively visualize design space exploration considering not only designs objectives, but also the characteristics and interdependencies of different designs.


2017 ◽  
Vol 139 (7) ◽  
Author(s):  
Clemens Muenzer ◽  
Kristina Shea

Current approaches in computational design synthesis (CDS) enable the human designer to explore large solution spaces for engineering design problems. To extend this to support designers in embodiment and detail design, not only the generation of solution spaces is needed but also the automated evaluation of engineering performance. Here, simulation methods can be used effectively to predict the behavior of a product. This paper builds on a general approach to automatically generate solution spaces for energy and signal-based engineering design tasks using first-order logic and Boolean satisfiability. The generated concept model graphs (CMGs) are now in this paper automatically transformed into corresponding bond-graph-based simulation models. To do this, guidelines for creating partial simulation models for the available synthesis building blocks are presented. The guidelines ensure valid causality in the final simulation model. Considering the connections in the concept model graphs, the simulation models are automatically generated and simulated. The simulation results are then used to calculate different objectives, constraints, and performance metrics. The method is validated using automotive powertrains as a case study. One hundred and sixty-two different powertrain concepts are generated and evaluated, showing the advantages of electric powertrains with respect to CO2 emissions and the importance of considering intelligent control strategies in the future for hybrid ones.


Author(s):  
Merel van Diepen ◽  
Kristina Shea

Soft robots are intrinsically compliant, which makes them suitable for interaction with delicate objects and living beings. The vast design space and the complex dynamic behavior of the elastic body of the robots make designing them by hand challenging, often requiring a large number of iterations. It is thus advantageous to design soft robots using a computational design approach that integrates simulation feedback. Since locomotion is an essential component in many robotic tasks, this paper presents the computational design synthesis of soft, virtual, locomotion robots. Methods used in previous work give little insight into and control over the computational design synthesis process. The generated solutions are also highly irregular and very different to hand-designed solutions. Also, the problem requirements are solely modeled in the objective function. Here, designs are generated using a spatial grammar with a rule set that is deduced from known locomotion principles. Spatial grammars make it possible to define the type of morphologies that are generated. The aim is to generate gaits based on different locomotion principles, e.g. walking, hopping and crawling. By combining a spatial grammar with simulated annealing, the solution space is searched for locomotive designs. The designs are simulated using a mass-spring model with stable self-collision so that all generated designs can be evaluated. The resulting virtual designs exhibit a large variety of expected and unexpected gaits. The grammar is analyzed to understand the generation process and assess the performance. The main contribution of this research is modeling of some of the results in the spatial grammar rather than the objective function. Thus, the process is guided towards a class of designs with extremities for locomotion, without having to define the class explicitly. Further, the simulation approach is new and results in a stable method that accounts for self-collision.


2020 ◽  
Vol 59 (51) ◽  
pp. 23137-23144
Author(s):  
Erik Andris ◽  
Koen Segers ◽  
Jaya Mehara ◽  
Lubomír Rulíšek ◽  
Jana Roithová

2018 ◽  
Vol 10 (43) ◽  
pp. 5214-5226 ◽  
Author(s):  
Farideh Ganjavi ◽  
Mehdi Ansari ◽  
Maryam Kazemipour ◽  
Leila Zeidabadinejad

A magnetic MIP for the selective extraction of buprenorphine (BUP) from real plasma and urine samples and tablets based on computational design as a novel procedure has been developed.


Author(s):  
ADITYA SOMAN ◽  
SWAPNIL PADHYE ◽  
MATTHEW I. CAMPBELL

The design of sheet metal components is perhaps one of the more challenging concurrent activities for design and manufacturing engineers. To aid this design process, a method is developed to encapsulate the constraints of sheet metal that make designing such components a tedious and iterative procedure. This project involves the implementation and testing of a geometric representation scheme for building feasible sheet metal components through the use of 17 grammar rules that capture manufacturing operations like cutting and bending. The implemented system has benefits both as a user interaction tool and as the basis for a computational design synthesis approach for designing sheet metal components. An example of a constructed sheet metal component is shown along with the method for invoking the sheet metal grammar to create this component.


Sign in / Sign up

Export Citation Format

Share Document