Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
|
Civil-Comp Proceedings
ISSN 1759-3433 CCP: 82
PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE ON THE APPLICATION OF ARTIFICIAL INTELLIGENCE TO CIVIL, STRUCTURAL AND ENVIRONMENTAL ENGINEERING Edited by: B.H.V. Topping
Paper 28
Conceptual Design of Geodesic Domes D.J. Shaw+, J.C. Miles+ and W.A. Gray*
+Cardiff School of Engineering
D.J. Shaw, J.C. Miles, W.A. Gray, "Conceptual Design of Geodesic Domes", in B.H.V. Topping, (Editor), "Proceedings of the Eighth International Conference on the Application of Artificial Intelligence to Civil, Structural and Environmental Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 28, 2005. doi:10.4203/ccp.82.28
Keywords: dome design, conceptual design, genetic algorithm, convex hull.
Summary
Using stochastic search algorithms for the conceptual design of geodesic domes is a
relatively neglected area of research, with very few papers published in the last 10
years [1,2]. Previous work in this area by Shea and Cagan [2] approaches the
problem by creating a 2D truss that is subsequently projected onto a predefined
curved surface. Therefore the solution is a 3D object, but the search is conducted in
2D. However while this 'projection' or 2.5D technique reduces the number of
problem variables, by constraining the third dimension to be dependent on the planar
layout, it also fixes the two most important variables of a dome: surface area and
enclosed volume, and thus produces results that are potentially sub-optimal.
This paper describes a new approach that uses a genetic algorithm [3,4], combined with convex hulls [5,6], a technique developed in computational geometry, to design domes in 3D (without the need to project onto a curved surface). The convex hull of a finite set of points S, is considered to be the convex polyhedron with the smallest volume that encloses S and can be determined by an incremental algorithm [5,6]. An incremental algorithm constructs the convex hull CH, of a finite set of points S, by initially developing the convex hull CHi-1 of a simple sub-set Si, of S. Having constructed the convex hull for Si, the algorithm then adds one point p at a time from S to Si and updates the convex hull depending on whether p is internal to Si. If p is internal to Si then the convex hull is unaltered however if p is external then the convex hull must be updated to accommodate p. To alter the convex hull the algorithm first needs to identify the horizon, which divides the convex hull into visible and invisible regions, a 'cone' of faces with an apex at p is then attached to the horizon. The genetic algorithm used in this work has a genome that is composed of three sections: user defined loads, location of the dome supports and the location of potential dome vertices and uses several standard evolutionary operators. Also because this work is aimed at the conceptual design stage, the number of initial input parameters has been kept to a minimum. Therefore the user is only required to input the location of any loads and define the size of the circular base. If requested, the user can specify the number and location of the dome supports otherwise the algorithm will search for appropriate support positions during the run. Once the genetic algorithm is started, it initialises the genome with random variables and runs until a predetermined number of generations have been evolved. The algorithm then returns a range of good solutions for the designer to analyse. Designing in 3D enables the genetic algorithm to search using all the available variables and hence allows for significantly better solutions to be evolved than was previously possible. However it should be noted that because geodesic breakdowns [7] are not explicitly enforced there is no guarantee that the evolved domes will rigidly adhere to geodesic patterns. References
purchase the full-text of this paper (price £20)
go to the previous paper |
|