.png){kind=icon}
.png){kind=icon}
Return
AONN-2: An adjoint-oriented neural network method for PDE-constrained shape optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.jcp.2024.113160.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
PDE-constrained shape optimization has been playing an important role in a large variety of engineering applications. Traditional mesh -dependent shape optimization methods often encounter challenges due to mesh deformation. To address this issue, we present a new adjointoriented neural network method, AONN-2, for PDE-constrained shape optimization problems. This method extends the capabilities of the original AONN method [1], which is developed for efficiently solving parametric optimal control problems. AONN-2 inherits from AONN the direct-adjoint looping (DAL) framework for computing the extremum of an objective functional and the involved neural network methods for solving complicated PDEs. Furthermore, AONN-2 expands the application scope to shape optimization by taking advantage of the shape derivatives to optimize the shape represented by discrete boundary points. AONN-2 is a fully mesh -free shape optimization approach, naturally sidestepping issues related to mesh deformation, with no needs for maintaining mesh quality and additional mesh corrections. A series of experimental results are presented, highlighting the flexibility, robustness, and accuracy of AONN-2.
Keywords:
Shape optimization
PDE-constrained optimization
Direct-adjoint looping
Deep neural network
Mesh-free
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
1.5W
Citations:
7.4W