Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-30T17:13:28.423Z Has data issue: false hasContentIssue false
  • English
  • Français

Improving efficiency of procedures for compositional synthesis by using bidirectional search

Published online by Cambridge University Press:  04 May 2001

AMARESH CHAKRABARTI
AMARESH CHAKRABARTI
Affiliation:
Engineering Design Centre, Department of Engineering, University of Cambridge, Trumpington Street, Cambridge CB2 1PZ, United Kingdom
Get access Rights & Permissions [Opens in a new window]

Abstract

This article is an attempt to improve the efficiency of procedures for compositional synthesis of design solutions using building blocks. These procedures have found use in a wide range of applications, and are one of the most substantial outcomes of research into automated synthesis of design solutions. Due to their combinatorial nature, these procedures are highly inefficient in solving problems, especially when the database of building blocks for synthesis or the problem size is large. Previous literature often focuses on improving only the algorithm part of a procedure, although it is both its algorithm and database which together determine the overall efficiency of the procedure. This article reports the construction and analysis of an improved algorithm, based on bidirectional search, for efficient compositional synthesis of design solutions using a set of building blocks.

Keywords

Automated Compositional SynthesisBidirectional SearchConcept GenerationEfficient Exhaustive Search AlgorithmEngineering Design
Type
Research Article
Information
AI EDAM , Volume 15 , Issue 1 , January 2001 , pp. 67 - 80
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)