Computer-automated design

Design Automation usually refers to electronic design automation, or Design Automation which is a Product Configurator. Extending Computer-Aided Design (CAD), automated design and Computer-Automated Design (CAutoD) are more concerned with a broader range of applications, such as automotive engineering, civil engineering, composite material design, control engineering, dynamic system identification and optimization, financial systems, industrial equipment, mechatronic systems, steel construction, structural optimisation, and the invention of novel systems.

The concept of CAutoD perhaps first appeared in 1963, in the IBM Journal of Research and Development, where a computer program was written.
# to search for logic circuits having certain constraints on hardware design
# to evaluate these logics in terms of their discriminating ability over samples of the character set they are expected to recognize.

More recently, traditional CAD simulation is seen to be transformed to CAutoD by biologically-inspired machine learning, including heuristic search techniques such as evolutionary computation, and swarm intelligence algorithms.Zhan, Z.H., et al. (2009). Adaptive Particle Swarm Optimization, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), Vol.39, No.6. 1362-1381
/ref>

Guiding designs by performance improvements

To meet the ever-growing demand of quality and competitiveness, iterative physical prototyping is now often replaced by 'digital prototyping' of a 'good design', which aims to meet multiple objectives such as maximised output, energy efficiency, highest speed and cost-effectiveness. The design problem concerns both finding the best design within a known range (i.e., through 'learning' or 'optimisation') and finding a new and better design beyond the existing ones (i.e., through creation and invention). This is equivalent to a search problem in an almost certainly, multidimensional (multivariate), multi-modal space with a single (or weighted) objective or multiple objectives.

Normalized objective function: cost vs. fitness

Using single-objective CAutoD as an example, if the objective function, either as a cost function J\in ,_\infty),_or_inversely,_as_a_fitness_function_$f\in(0,1.html" ;"title="fitness_function.html" ;"title=", \infty)$, or inversely, as a fitness function">, \infty), or inversely, as a fitness function $f\in(0,1">fitness_function.html" ;"title=", \infty)$, or inversely, as a fitness function">, \infty), or inversely, as a fitness function f\in(0,1/math>, where

:$f = \tfrac$,

is differentiable under practical constraints in the multidimensional space, the design problem may be solved analytically. Finding the parameter sets that result in a zero first-order derivative and that satisfy the second-order derivative conditions would reveal all local optima. Then comparing the values of the performance index of all the local optima, together with those of all boundary parameter sets, would lead to the global optimum, whose corresponding 'parameter' set will thus represent the best design. However, in practice, the optimization usually involves multiple objectives and the matters involving derivatives are a lot more complex.

Dealing with practical objectives

In practice, the objective value may be noisy or even non-numerical, and hence its gradient information may be unreliable or unavailable. This is particularly true when the problem is multi-objective. At present, many designs and refinements are mainly made through a manual trial-and-error process with the help of a CAD simulation package. Usually, such ''a posteriori'' learning or adjustments need to be repeated many times until a ‘satisfactory’ or ‘optimal’ design emerges.

Exhaustive search

In theory, this adjustment process can be automated by computerised search, such as exhaustive search. As this is an exponential algorithm, it may not deliver solutions in practice within a limited period of time.

Search in polynomial time

One approach to virtual engineering and automated design is evolutionary computation such as evolutionary algorithms.

Evolutionary algorithms

To reduce the search time, the biologically-inspired evolutionary algorithm (EA) can be used instead, which is a (non-deterministic) polynomial algorithm. The EA based multi-objective "search team" can be interfaced with an existing CAD simulation package in a batch mode. The EA encodes the design parameters (encoding being necessary if some parameters are non-numerical) to refine multiple candidates through parallel and interactive search. In the search process, 'selection' is performed using 'survival of the fittest' ''a posteriori'' learning. To obtain the next 'generation' of possible solutions, some parameter values are exchanged between two candidates (by an operation called 'crossover') and new values introduced (by an operation called 'mutation'). This way, the evolutionary technique makes use of past trial information in a similarly intelligent manner to the human designer.

The EA based optimal designs can start from the designer's existing design database, or from an initial generation of candidate designs obtained randomly. A number of finely evolved top-performing candidates will represent several automatically optimized digital prototypes.

There are websites that demonstrate interactive evolutionary algorithms for design
EndlessForms.com
allows you to evolve 3D objects online and have them 3D printed.
PicBreeder.org
allows you to do the same for 2D images.

See also

* Electronic design automation
* Design Automation
* Design Automation Conference
* Generative design
* Genetic algorithm (GA) applications - automated design

References

External links

An online interactive GA based CAutoD demonstrator.
Learn step by step or watch global convergence in 2-parameter CAutoD

{{DEFAULTSORT:Computer-Automated Design
Design
Computer-aided design
Evolutionary algorithms
Evolutionary computation