A Quasi-Optimal Shape Design Method for Lattice Structure Construction
Sifan Chen, Yuan Kong, Qiang Zou
TL;DR
The paper tackles robust lattice structure construction by replacing complex nodal geometry with optimized, watertight nodal patches. It introduces a three-step workflow—optimal cutting, optimal nodal shape design via Grey Wolf optimization, and lattice stitching—to remove inter-strut intersections while preserving geometry, supplemented by multiresolution mesh generation. Quantitative results across 10 case studies show reduced shape deviation compared with prior methods and efficient GPU-enabled optimization, demonstrating improved robustness and practicality for downstream fabrication and simulation. The work advances lattice modeling by integrating meta-heuristic optimization into B-rep construction and providing a flexible, non-triangular-face lattice representation suitable for precise manufacturing.
Abstract
Lattice structures, known for their superior mechanical properties, are widely used in industries such as aerospace, automotive, and biomedical. Their advantages primarily lie in the interconnected struts at the micro-scale. The robust construction of these struts is crucial for downstream design and manufacturing applications, as it provides a detailed shape description necessary for precise simulation and fabrication. However, constructing lattice structures presents significant challenges, particularly at nodes where multiple struts intersect. The complexity of these intersections can lead to robustness issues. To address this challenge, this paper presents an optimization-based approach that simplifies the construction of lattice structures by cutting struts and connecting them to optimized node shapes. By utilizing the recent Grey Wolf optimization method -- a type of meta-heuristic method -- for node shape design, the approach ensures robust model construction and optimal shape design. Its effectiveness has been validated through a series of case studies with increasing topological and geometric complexity.
