HGTO: A Unified Graph-Based Physics-Informed Formulation for Structural Topology Optimization

• URL: http://arxiv.org/abs/2609.15001v1
• Date: Mon, 14 Sep 2026 04:06:36 GMT
• Title: HGTO: A Unified Graph-Based Physics-Informed Formulation for Structural Topology Optimization
• Abstract summary: HGTO is a unified graph-based formulation that extends complete neural topology optimization from coordinate space to finite-element graph space.<n> numerical studies show compliance comparable to conventional density-based optimization at substantially lower computational cost.<n>Same coupled formulation accommodates high-resolution and irregular meshes, three-dimensional structures, finite deformation, and elastoplastic response.
• Score: 0.7839702446696094
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Density-based topology optimization is typically structured as a nested sequence of material updates, structural analyses, and sensitivity assessments. While neural density parameterization and dual-field physics-informed approaches provide data-free alternatives, most existing methods represent density and displacement as coordinate fields and make limited use of the discrete relationships inherent in the finite element mesh. The present study introduces HGTO, a unified graph-based formulation that extends complete neural topology optimization from coordinate space to finite-element graph space. Element densities are parameterized on the element graph derived from the mesh, and the structural state is determined on the corresponding node--element hypergraph. Finite element kinematics, numerical quadrature, constitutive response, and force assembly remain explicitly defined operations within the differentiable computation. The material field and equilibrium state are therefore coupled through a common finite-element incidence structure. Numerical studies show compliance comparable to conventional density-based optimization at substantially lower computational cost than a representative coordinate-based dual-field neural method. The same coupled formulation accommodates high-resolution and irregular meshes, three-dimensional structures, finite deformation, and elastoplastic response.

Related papers

• Rethinking Input Domains in Physics-Informed Neural Networks via Geometric Compactification Mappings [17.201530991184814]
  We introduce a mapping paradigm that reshapes the input coordinates through differentiable geometric compactification mappings.<n>We show that this approach yields more uniform residual distributions and higher solution accuracy on representative 1D and 2D PDEs.
  arXiv  Detail & Related papers  (2026-02-18T05:27:53Z)
• Differentiable Tripartite Modularity for Clustering Heterogeneous Graphs [0.0]
  We introduce a differentiable formulation of tripartite modularity for graphs composed of three node types connected through mediated interactions.<n>Community structure is defined in terms of weighted co-paths across the tripartite graph, together with an exact factorized computation that avoids the explicit construction of dense third-order tensors.<n>We validate the proposed framework on large-scale urban cadastral data, where it exhibits robust convergence behavior and produces spatially coherent partitions.
  arXiv  Detail & Related papers  (2026-02-10T15:06:53Z)
• Structure-Preserving Learning Improves Geometry Generalization in Neural PDEs [7.60216127875876]
  We introduce General-Geometry Neural Whitney Forms (Geo-NeW): a data-driven finite element method.<n>We demonstrate state-of-the-art performance on several steady-state PDE benchmarks, and provide a significant improvement over conventional baselines on out-of-distribution geometries.
  arXiv  Detail & Related papers  (2026-02-02T20:45:07Z)
• ARC-Flow : Articulated, Resolution-Agnostic, Correspondence-Free Matching and Interpolation of 3D Shapes Under Flow Fields [4.706075725469252]
  This work presents a unified framework for the unsupervised prediction of physically plausibles between two 3D articulated shapes.<n>Interpolation is modelled as a diffeomorphic transformation using a smooth, time-varying flow field governed by Neural Ordinary Differential Equations (ODEs)<n>Correspondence is recovered using an efficient Varifold formulation, that is effective on high-fidelity surfaces with differing parameterisations.
  arXiv  Detail & Related papers  (2025-03-04T13:28:05Z)
• Form-Finding and Physical Property Predictions of Tensegrity Structures Using Deep Neural Networks [39.19016806159609]
  We develop a deep neural network (DNN) approach to predict the geometric configurations and physical properties of tensegrity structures. For validation, we analyze three tensegrity structures, including a tensegrity D-bar, prism, and lander.
  arXiv  Detail & Related papers  (2024-06-15T16:39:53Z)
• Equivariant Graph Mechanics Networks with Constraints [83.38709956935095]
  We propose Graph Mechanics Network (GMN) which is efficient, equivariant and constraint-aware. GMN represents, by generalized coordinates, the forward kinematics information (positions and velocities) of a structural object. Extensive experiments support the advantages of GMN compared to the state-of-the-art GNNs in terms of prediction accuracy, constraint satisfaction and data efficiency.
  arXiv  Detail & Related papers  (2022-03-12T14:22:14Z)
• Dist2Cycle: A Simplicial Neural Network for Homology Localization [66.15805004725809]
  Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations. We propose a graph convolutional model for learning functions parametrized by the $k$-homological features of simplicial complexes.
  arXiv  Detail & Related papers  (2021-10-28T14:59:41Z)
• A deep learning driven pseudospectral PCE based FFT homogenization algorithm for complex microstructures [68.8204255655161]
  It is shown that the proposed method is able to predict central moments of interest while being magnitudes faster to evaluate than traditional approaches. It is shown, that the proposed method is able to predict central moments of interest while being magnitudes faster to evaluate than traditional approaches.
  arXiv  Detail & Related papers  (2021-10-26T07:02:14Z)
• An End-to-End Framework for Molecular Conformation Generation via Bilevel Programming [71.82571553927619]
  We propose an end-to-end solution for molecular conformation prediction called ConfVAE. Specifically, the molecular graph is first encoded in a latent space, and then the 3D structures are generated by solving a principled bilevel optimization program.
  arXiv  Detail & Related papers  (2021-05-15T15:22:29Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)
• Fast Gravitational Approach for Rigid Point Set Registration with Ordinary Differential Equations [79.71184760864507]
  This article introduces a new physics-based method for rigid point set alignment called Fast Gravitational Approach (FGA) In FGA, the source and target point sets are interpreted as rigid particle swarms with masses interacting in a globally multiply-linked manner while moving in a simulated gravitational force field. We show that the new method class has characteristics not found in previous alignment methods.
  arXiv  Detail & Related papers  (2020-09-28T15:05:39Z)

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.