Reinforcement learning for block decomposition of planar CAD models
BC DiPrete, R Garimella, CG Cardona… - Engineering with …, 2024 - Springer
Engineering with Computers, 2024•Springer
The problem of hexahedral mesh generation of general CAD models has vexed researchers
for over 3 decades and analysts often spend more than 50% of the design-analysis cycle
time decomposing complex models into simpler blocks meshable by existing techniques.
The decomposed blocks are required for generating good quality meshes (tilings of
quadrilaterals or hexahedra) suitable for numerical simulations of physical systems
governed by conservation laws. We present a novel AI-assisted method for decomposing …
for over 3 decades and analysts often spend more than 50% of the design-analysis cycle
time decomposing complex models into simpler blocks meshable by existing techniques.
The decomposed blocks are required for generating good quality meshes (tilings of
quadrilaterals or hexahedra) suitable for numerical simulations of physical systems
governed by conservation laws. We present a novel AI-assisted method for decomposing …
Abstract
The problem of hexahedral mesh generation of general CAD models has vexed researchers for over 3 decades and analysts often spend more than 50% of the design-analysis cycle time decomposing complex models into simpler blocks meshable by existing techniques. The decomposed blocks are required for generating good quality meshes (tilings of quadrilaterals or hexahedra) suitable for numerical simulations of physical systems governed by conservation laws. We present a novel AI-assisted method for decomposing (segmenting) planar CAD (computer-aided design) models into well shaped rectangular blocks. Even though the simple examples presented here can also be meshed using many conventional methods, we believe this work is proof-of-principle of a AI-based decomposition method that can eventually be generalized to complex 2D and 3D CAD models. Our method uses reinforcement learning to train an agent to perform a series of optimal cuts on the CAD model that result in a good quality block decomposition. We show that the agent quickly learns an effective strategy for picking the location and direction of the cuts and maximizing its rewards. This paper is the first successful demonstration of an agent autonomously learning how to perform this block decomposition task effectively, thereby holding the promise of a viable method to automate this challenging process for more complex cases.
Springer
Showing the best result for this search. See all results