Topology optimization of periodic lattice structures for specified mechanical properties using machine learning considering member connectivity

• URL: http://arxiv.org/abs/2411.13869v1
• Date: Thu, 21 Nov 2024 06:07:36 GMT
• Title: Topology optimization of periodic lattice structures for specified mechanical properties using machine learning considering member connectivity
• Authors: Tomoya Matsuoka, Makoto Ohsaki, Kazuki Hayashi,
• Abstract summary: We investigate data representation of lattice structures used as input data for machine learning models. We use the filtering technique to explicitly consider the connectivity of lattice members. We propose a convolution approach to apply pre-trained models for small structures to structures of larger sizes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This study proposes a methodology to utilize machine learning (ML) for topology optimization of periodic lattice structures. In particular, we investigate data representation of lattice structures used as input data for ML models to improve the performance of the models, focusing on the filtering process and feature selection. We use the filtering technique to explicitly consider the connectivity of lattice members and perform feature selection to reduce the input data size. In addition, we propose a convolution approach to apply pre-trained models for small structures to structures of larger sizes. The computational cost for obtaining optimal topologies by a heuristic method is reduced by incorporating the prediction of the trained ML model into the optimization process. In the numerical examples, a response prediction model is constructed for a lattice structure of 4x4 units, and topology optimization of 4x4-unit and 8x8-unit structures is performed by simulated annealing assisted by the trained ML model. The example demonstrates that ML models perform higher accuracy by using the filtered data as input than by solely using the data representing the existence of each member. It is also demonstrated that a small-scale prediction model can be constructed with sufficient accuracy by feature selection. Additionally, the proposed method can find the optimal structure in less computation time than the pure simulated annealing.

Related papers

• Spectral Normalization and Voigt-Reuss net: A universal approach to microstructure-property forecasting with physical guarantees [0.0]
  A crucial step in the design process is the rapid evaluation of effective mechanical, thermal, or, in general, elasticity properties. The classical simulation-based approach, which uses, e.g., finite elements and FFT-based solvers, can require substantial computational resources. We propose a novel spectral normalization scheme that a priori enforces these bounds.
  arXiv  Detail & Related papers  (2025-04-01T12:21:57Z)
• Optimization-Driven Statistical Models of Anatomies using Radial Basis Function Shape Representation [3.743399165184124]
  Particle-based shape modeling is a popular approach to quantify shape variability in populations of anatomies. We propose an adaptation of this method using a traditional optimization approach that allows more precise control over the desired characteristics of models. We demonstrate the efficacy of the proposed approach to state-of-the-art methods on two real datasets and justify our choice of losses empirically.
  arXiv  Detail & Related papers  (2024-11-24T15:43:01Z)
• Extrapolative ML Models for Copolymers [1.901715290314837]
  Machine learning models have been progressively used for predicting materials properties. These models are inherently interpolative, and their efficacy for searching candidates outside a material's known range of property is unresolved. Here, we determine the relationship between the extrapolation ability of an ML model, the size and range of its training dataset, and its learning approach.
  arXiv  Detail & Related papers  (2024-09-15T11:02:01Z)
• Functional Graphical Models: Structure Enables Offline Data-Driven Optimization [111.28605744661638]
  We show how structure can enable sample-efficient data-driven optimization. We also present a data-driven optimization algorithm that infers the FGM structure itself.
  arXiv  Detail & Related papers  (2024-01-08T22:33:14Z)
• Optimal Variable Clustering for High-Dimensional Matrix Valued Data [3.1138411427556445]
  We propose a new latent variable model for the features arranged in matrix form. Under mild conditions, our algorithm attains clustering consistency in the high-dimensional setting. We identify the optimal weight in the sense that using this weight guarantees our algorithm to be minimax rate-optimal.
  arXiv  Detail & Related papers  (2021-12-24T02:13:04Z)
• Conservative Objective Models for Effective Offline Model-Based Optimization [78.19085445065845]
  Computational design problems arise in a number of settings, from synthetic biology to computer architectures. We propose a method that learns a model of the objective function that lower bounds the actual value of the ground-truth objective on out-of-distribution inputs. COMs are simple to implement and outperform a number of existing methods on a wide range of MBO problems.
  arXiv  Detail & Related papers  (2021-07-14T17:55:28Z)
• Model-agnostic multi-objective approach for the evolutionary discovery of mathematical models [55.41644538483948]
  In modern data science, it is more interesting to understand the properties of the model, which parts could be replaced to obtain better results. We use multi-objective evolutionary optimization for composite data-driven model learning to obtain the algorithm's desired properties.
  arXiv  Detail & Related papers  (2021-07-07T11:17:09Z)
• Surrogate Models for Optimization of Dynamical Systems [0.0]
  This paper provides a smart data driven mechanism to construct low dimensional surrogate models. These surrogate models reduce the computational time for solution of the complex optimization problems.
  arXiv  Detail & Related papers  (2021-01-22T14:09:30Z)
• Sparse PCA via $l_{2,p}$-Norm Regularization for Unsupervised Feature Selection [138.97647716793333]
  We propose a simple and efficient unsupervised feature selection method, by combining reconstruction error with $l_2,p$-norm regularization. We present an efficient optimization algorithm to solve the proposed unsupervised model, and analyse the convergence and computational complexity of the algorithm theoretically.
  arXiv  Detail & Related papers  (2020-12-29T04:08:38Z)
• An AI-Assisted Design Method for Topology Optimization Without Pre-Optimized Training Data [68.8204255655161]
  An AI-assisted design method based on topology optimization is presented, which is able to obtain optimized designs in a direct way. Designs are provided by an artificial neural network, the predictor, on the basis of boundary conditions and degree of filling as input data.
  arXiv  Detail & Related papers  (2020-12-11T14:33:27Z)
• Goal-directed Generation of Discrete Structures with Conditional Generative Models [85.51463588099556]
  We introduce a novel approach to directly optimize a reinforcement learning objective, maximizing an expected reward. We test our methodology on two tasks: generating molecules with user-defined properties and identifying short python expressions which evaluate to a given target value.
  arXiv  Detail & Related papers  (2020-10-05T20:03:13Z)
• Improving Molecular Design by Stochastic Iterative Target Augmentation [38.44457632751997]
  Generative models in molecular design tend to be richly parameterized, data-hungry neural models. We propose a surprisingly effective self-training approach for iteratively creating additional molecular targets. Our approach outperforms the previous state-of-the-art in conditional molecular design by over 10% in absolute gain.
  arXiv  Detail & Related papers  (2020-02-11T22:40:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.