Downloads: 77
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
s10489-023-04565-w.pdf | 1.19 MB | Adobe PDF | View/Open |
Title: | Deep deterministic policy gradient and graph attention network for geometry optimization of latticed shells |
Authors: | Kupwiwat, Chi-tathon Hayashi, Kazuki https://orcid.org/0000-0002-4026-8234 (unconfirmed) Ohsaki, Makoto https://orcid.org/0000-0003-4935-8874 (unconfirmed) |
Author's alias: | 林, 和希 大﨑, 純 |
Keywords: | Bézier surface Deep deterministic policy gradient Geometry optimization Graph attention network Reinforcement learning |
Issue Date: | Sep-2023 |
Publisher: | Springer Nature |
Journal title: | Applied Intelligence |
Volume: | 53 |
Issue: | 17 |
Start page: | 19809 |
End page: | 19826 |
Abstract: | This paper proposes a combined approach of deep deterministic policy gradient (DDPG) and graph attention network (GAT) to the geometry optimization of latticed shells with surface shapes defined by a Bézier control net. The optimization problem is formulated to minimize the strain energy of the latticed structures with heights of the Bézier control points as design variables. The information of the latticed shells, including nodal configurations, element properties and internal forces, and the Bézier control net, consisting of control points and control net, are represented as graphs using node feature matrices, adjacency matrices, and weighted adjacency matrices. A specifically designed DDPG agent utilizes GAT and matrix manipulations to observe the state of the structure through the graphs, and decides which and how Bézier control points to move. The agent is trained to excel in the task through a reward signal computed from changes in the strain energy in each optimization step. As shown in numerical examples, the trained agent can effectively optimize structures of different sizes, control nets, configurations, and initial geometries from those used during the training. The performance of the trained agent is competitive compared to particle swarm optimization and simulated annealing despite using a lower computational cost. |
Rights: | This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.org/10.1007/s10489-023-04565-w The full-text file will be made open to the public on 17 March 2024 in accordance with publisher's 'Terms and Conditions for Self-Archiving'. This is not the published version. Please cite only the published version. この論文は出版社版でありません。引用の際には出版社版をご確認ご利用ください。 |
URI: | http://hdl.handle.net/2433/285165 |
DOI(Published Version): | 10.1007/s10489-023-04565-w |
Appears in Collections: | Journal Articles |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.