Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
|
Civil-Comp Proceedings
ISSN 1759-3433 CCP: 100
PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE ON ENGINEERING COMPUTATIONAL TECHNOLOGY Edited by: B.H.V. Topping
Paper 76
A Method for Maximin Constrained Design of Experiments E. Myšáková, M. Lepš and A. Kucerová
Department of Mechanics, Faculty of Civil Engineering, Czech Technical University in Prague, Czech Republic , "A Method for Maximin Constrained Design of Experiments", in B.H.V. Topping, (Editor), "Proceedings of the Eighth International Conference on Engineering Computational Technology", Civil-Comp Press, Stirlingshire, UK, Paper 76, 2012. doi:10.4203/ccp.100.76
Keywords: design of experiments, latin hypercube sampling, constrained design spaces, non-regular design spaces, space-filling, Delaunay triangulation.
Summary
Space-filling design strategies known as design of experiments (DoE) constitute
an essential part of any experimentation. This paper concerns one particular
domain of constrained design spaces. The most frequent example is the case of
a mixture experiment, where individual inputs form a unity volume or unity weight
[1]. This single condition leads to the simplex space; further limits
on individual inputs then form a polytope, still convex but generally an irregular space.
Therefore, all traditional DoEs [1] that are constructed for hypercube
spaces cannot be applied here. Although the problem of mixture experiments has been
known for decades, the progress of the methods for DoEs does not follow current developments.
In this paper a different approach based on Delaunay triangulation (DT) of an admissible domain and a utilization of the properties of the Distmesh tool (DM) [2] is presented. In the authors' method the domain described by corner vertices is triangulated using DT and the desired number of random points is generated inside. Then the DM tool is applied. The Distmesh tool is a heuristic smoothing algorithm for generating uniform meshes that is based on a simple dynamic system of an expanding pin-jointed structure. Those trusses that are too short cause repulsive forces that move apart nodes that are too close creating uniformly spaced points. The results are compared with seven constrained examples in two dimensions and one three dimensional example presented in [3], namely a placing of design points in a triangle, parallelogram, pentagon, hexagon, heptagon, octagon, irregular hexagon and prism. Although not designed directly for space-filling optimization, our procedure is able to outperform the reference algorithm even from the D-optimal point of view; however, only in two-dimensions as is shown in the paper. References
purchase the full-text of this paper (price £20)
go to the previous paper |
|