Efficient Structural Topology Optimization Based on Artificial Neural Networks

作者
Kangjie Li
标识
DOI:10.14711/thesis-hdl152385
摘要

Topology optimization (TO) is a powerful computational tool for the design of high-performance structures by optimally distributing material within a prescribed domain. It has enabled significant progress in various engineering applications, including lightweight structural design in aerospace and automotive industries. In these applications, achieving near-optimal performance often requires extremely high-resolution designs with billions of finite elements. However, conventional structural TO methods suffer from prohibitively high computational costs due to repeated high-dimensional simulations required in each optimization iteration. This not only leads to inefficiencies but also demands massive power consumption, which hinders their deployment in real-world design scenarios. This thesis presents a set of efficient structural TO frameworks empowered by artificial neural networks (ANNs), aiming to drastically reduce the computational burden while maintaining design accuracy. Two key categories of TO problems are considered: (1) scenarios that require generating multiple similar designs, and (2) large-scale, high-resolution design tasks. A fundamental distinction between these two lies in data availability-ample training data can be collected for the first type, making it suitable for offline learning, whereas the second type typically lacks sufficient data. To address the first category, a coarse-to-fine structure mapping strategy is introduced, where response calculations are conducted on a coarse grid. A structure mapping neural network (SMapNN) is trained to reconstruct the fine grid design from the coarse grid design at each iteration, thus eliminating the need for expensive fine grid simulations. Fragmentation and padding techniques are further introduced to enhance the generalization capability of the SMapNN. 3D compliance design results demonstrate that, on a high-resolution mesh with over 2 million finite elements, the proposed approach achieves about 23 times speedup while maintaining over 99% compliance accuracy. For large-scale TO where generating extensive training data is challenging, online learning methods present a promising solution. These methods enable adaptive training of surrogate models during the optimization process by leveraging data from previous iterations. However, current online learning approaches employ a coarse-to-fine localized mapping strategy that may compromise surrogate model accuracy due to insufficient global information. Our second framework aims to overcome the undetermined mapping issue of existing online learning TO methods. A mapping between local patches and sensitivities is established by employing the Fourier Neural Operator (FNO) as a surrogate model. By embedding global context into local patches, the mapping uniqueness is significantly improved. The training and inference processes are performed entirely on a single-resolution mesh, avoiding costly coarse-grid simulations of the existing method. The results of numerical experiments demonstrate the effectiveness of the proposed framework across various compliance design problems-for instance, it achieves a 4.3-fold speedup in a 3D cantilever design case with about 0.5 million resolutions. Lastly, this approach is further extended into the isogeometric analysis framework, enabling accurate geometric representation and improved stress evaluation. We then demonstrate the framework’s effectiveness through several 2D stress-constrained design cases, where the method achieves a 1.8 times speedup on a problem with about 20 thousands control points, and greater acceleration is expected for large-scale 3D designs. To address the relatively high training and inference cost of the FNO, a decomposed FNO (D-FNO) is finally proposed. By decomposing high-dimensional latent features into a series of rank-1 tensor products, the traditional three-dimensional (3D) fast Fourier transform (FFT) is replaced with a series of one-dimensional FFTs, reducing the computational complexity from 𝑂(𝑁3log𝑁) to 𝑂(𝑃𝑁log𝑁) in 3D problems, where 𝑃 is the decomposition term. The D- FNO is validated across various PDE scenarios. In the most challenging 3D elastic wave propagation experiment, the D-FNO reduces the training time by up to 7.6 times and inference time by 7.0 times, while maintaining a slightly better prediction accuracy. Finally, its effectiveness is further demonstrated in 3D online learning TO tasks. It achieves a 4.6-fold speedup in a cantilever design case with about 0.5 million resolutions, showing 8.2% efficiency improvement compared to the standard FNO.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
大气的莆完成签到,获得积分10
刚刚
刚刚
1秒前
cheng完成签到,获得积分10
1秒前
1秒前
qz关闭了qz的文献求助
1秒前
1秒前
NN发布了新的文献求助30
2秒前
Irene发布了新的文献求助10
2秒前
2秒前
2秒前
陈陈陈完成签到 ,获得积分10
3秒前
llllll完成签到,获得积分20
3秒前
4秒前
浮生绘完成签到,获得积分10
4秒前
cheng发布了新的文献求助10
4秒前
所所的应助被Atue采纳,获得10
5秒前
5秒前
5秒前
elvira的应助被舒适的秋尽采纳,获得10
5秒前
CodeCraft的应助被kuaikuai采纳,获得10
5秒前
6秒前
丘比特的应助被Irene采纳,获得10
6秒前
JamesPei的应助被shidewu采纳,获得10
6秒前
7秒前
7秒前
搜集达人的应助被张张采纳,获得10
7秒前
不安易文发布了新的文献求助10
8秒前
jiajiajai完成签到,获得积分10
8秒前
Youzi完成签到,获得积分10
8秒前
无花果的应助被玩家666采纳,获得10
8秒前
科研小白发布了新的文献求助10
9秒前
过几天发布了新的文献求助10
10秒前
JamesPei的应助被小太阳采纳,获得10
10秒前
wby完成签到 ,获得积分10
11秒前
叶95发布了新的文献求助10
11秒前
苗条梨愁发布了新的文献求助10
11秒前
舒适的秋尽给舒适的秋尽的求助进行了留言
12秒前
12秒前
苏暮迟发布了新的文献求助10
12秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
Grapes 1000
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
John McDowells Bildungstheorie 800
八旗制度の研究 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8178484
求助须知:如何正确求助?哪些是违规求助? 9569318
关于积分的说明 21803439
捐赠科研通 7773381
什么是DOI,文献DOI怎么找? 3432819
关于科研通互助平台的介绍 2556838
邀请新用户注册赠送积分活动 2478441