arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.10072cs.CE
收藏

基于可微有限元的拓扑优化

Topology Optimization through Differentiable Finite Element Solver

Liang Chen, Herman M. H. Shen

摘要:

本文提出了一种利用自动微分的拓扑优化框架,通过全可微有限元求解器计算梯度来求解二维密度拓扑优化问题。提出了基于可微物理求解器的优化框架,并在几个经典拓扑优化算例上进行了测试。可微分求解器是用Julia程序设计语言实现的,可以在反向模式下自动微分,以提供每一个操作的回调函数。整个端到端的梯度信息,然后可以备份,利用链规则。这个框架包含了一个由卷积层构建的生成器,它有一组可学习的参数,可以为每次迭代提出新的设计。由于整个过程是可微分的,所以在给定来自自动微分的梯度信息的情况下,可以使用任何优化算法来更新生成器的参数。所提出的优化框架上设计了半MBB梁,并与高效的88行代码的结果进行了比较。通过仅改变目标函数和边界条件,它可以运行用于设计柔性机构的优化,例如,输出位移与输入方向相反的力逆变器。

英文摘要:

In this paper, a topology optimization framework utilizing automatic differentiation is presented as an efficient way for solving 2D density-based topology optimization problem by calculating gradients through the fully differentiable finite element solver. The optimization framework with the differentiable physics solver is proposed and tested on several classical topology optimization examples. The differentiable solver is implemented in Julia programming language and can be automatically differentiated in reverse mode to provide the pullback functions of every single operation. The entire end-to-end gradient information can be then backed up by utilizing chain rule. This framework incorporates a generator built from convolutional layers with a set of learnable parameters to propose new designs for every iteration. Since the whole process is differentiable, the parameters of the generator can be updated using any optimization algorithm given the gradient information from automatic differentiation. The proposed optimization framework is demonstrated on designing a half MBB beam and compared to the results with the ones from the efficient 88-line code. By only changing the objective function and the boundary conditions, it can run an optimization for designing a compliant mechanism, e.g. a force inverter where the output displacement is in the opposite direction of the input.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑