Recursive annealing: A computational model for machine design |
| |
Authors: | Linda C Schmidt Jonathan Cagan |
| |
Affiliation: | (1) Department of Mechanical Engineering, Carnegie Mellon University, 15213 Pittsburgh, PA, USA |
| |
Abstract: | We propose a model for optimally directed conceptual design of machines in which the transformation of function to form occurs iteratively along an abstraction continuum. An algorithm called FFREADA is introduced as a computational implementation of the model. FFREADA is a grammar-based optimizing design algorithm that uses recursive simulated annealing to generate optimally directed designs. During FFREADA's design process, the mapping of function to form is accomplished using an abstraction grammar production system and a predefined library of function and form entities. FFREADA also has a random design generation mode that can be used to record data to characterize the space of design solutions. FFREADA is demonstrated by designing an idealized power supply using a variety of performance objectives. Results show the algorithm able to explore and record information about a tractably infinite design space before converging to the optimal design. |
| |
Keywords: | Abstraction Conceptual design Design theory Grammars Simulated annealing |
本文献已被 SpringerLink 等数据库收录! |