Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-26T18:05:01.800Z Has data issue: false hasContentIssue false

A voxel-based representation for evolutionary shape optimization

Published online by Cambridge University Press:  01 June 1999

PETER BARON
Affiliation:
Department of Artificial Intelligence, University of Edinburgh, 5 Forrest Hill, Edinburgh EH1 2QL, Scotland, UK.
ROBERT FISHER
Affiliation:
Department of Artificial Intelligence, University of Edinburgh, 5 Forrest Hill, Edinburgh EH1 2QL, Scotland, UK.
ANDREW TUSON
Affiliation:
Department of Computing, City University, Northampton Square, London, EC1V 0HB, UK.
FRANK MILL
Affiliation:
Department of Mechanical Engineering, University of Edinburgh, Sanderson Building, The King's Buildings, Mayfield Road, Edinburgh EH9 3JL, Scotland, UK.
ANDREW SHERLOCK
Affiliation:
Department of Mechanical Engineering, University of Edinburgh, Sanderson Building, The King's Buildings, Mayfield Road, Edinburgh EH9 3JL, Scotland, UK.

Abstract

A voxel-based shape representation when integrated with an evolutionary algorithm offers a number of potential advantages for shape optimization. Topology need not be predefined, geometric constraints are easily imposed and, with adequate resolution, any shape can be approximated to arbitrary accuracy. However, lack of boundary smoothness, length of chromosome, and inclusion of small holes in the final shape have been stated as problems with this representation. This paper describes two experiments performed in an attempt to address some of these problems. First, a design problem with only a small computational cost of evaluating candidate shapes was used as a testbed for designing genetic operators for this shape representation. Second, these operators were refined for a design problem using a more costly finite element evaluation. It was concluded that the voxel representation can, with careful design of genetic operators, be useful in shape optimization.

Type
Research Article
Copyright
© 1999 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.)