A data-driven investigation and estimation of optimal topologies under variable loading configurations

5Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We explore the feasibility and performance of a data-driven approach to topology optimization problems involving structural mechanics. Our approach takes as input a set of images representing optimal 2-D topologies, each resulting from a random loading configuration applied to a common boundary support condition. These images represented in a high dimensional feature space are projected into a lower dimensional space using component analysis. Using the resulting components, a mapping between the loading configurations and the optimal topologies is learned. From this mapping, we estimate the optimal topologies for novel loading configurations. The results indicate that when there is an underlying structure in the set of existing solutions, the proposed method can successfully predict the optimal topologies in novel loading configurations. In addition, the topologies predicted by the proposed method can be used as effective initial conditions for conventional topology optimization routines, resulting in substantial performance gains. We discuss the advantages and limitations of the presented approach and show its performance on a number of examples. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Ulu, E., Zhang, R., Yumer, M. E., & Kara, L. B. (2014). A data-driven investigation and estimation of optimal topologies under variable loading configurations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8641 LNCS, pp. 387–399). Springer Verlag. https://doi.org/10.1007/978-3-319-09994-1_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free