Abstract

Topology optimization of shell–infill structures has been a hot topic in the optimization community. The crucial issue of such design problem is how to accurately describe the material interfaces, which is often regarded as a relatively difficult problem in density-based topology optimization. This paper presents an erosion-based interface identification method to handle this difficulty by defining the different parts of the original and eroded structures as interfaces. The theoretical relation for determining the erosion parameters is derived to control the interface thickness accurately. It turns out that the erosion-based method offers excellent performance even for the extreme cases where the ratios of member sizes to a prescribed thickness are small, and at the same time, it is easy to implement since we only need to consider the frequently-used filtering and projection processes in the applied erosion operation. Then, we provide an improved SIMP-based topology optimization method for shell–infill structures based on the new idea of defining interfaces. In this paper, a tweak to the existing two-step filtering/projection process is made to separate the shell and infill, and a corresponding interpolation function is developed to model the whole composite objects. Enhanced by the worst-case based robust formulation, the minimum length scale of optimized structures can be controlled. Several 2D and 3D compliance optimization examples are provided to illustrate the effectiveness of the proposed method.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.