带显式长度约束的椭圆掩模和蜂窝网格拓扑优化
On Topology optimization with elliptical masks and honeycomb tessellation with explicit length scale constraints
摘要:
提出了一种基于梯度搜索的拓扑优化方法,该方法采用负椭圆和正椭圆掩模以及蜂窝网格划分。通过一种新的拓扑结构定义使用填充和空六角形单元/元素,明确的最小和最大长度尺度施加在固态的解决方案,通过一种新的technonization算法。一个分析的例子表明,对于一个非线性拓扑结构,最佳解决方案可能并不总是存在任何指定的体积分数,最小和最大的长度尺度,并且可能存在隐含的相互依存关系。提出了一种长度尺度序列(SLS)方法,其中通过仅指定最小和最大长度尺度来寻求解决方案,并系统地确定体积分数。通过小变形拓扑优化中的四个基准问题,证明了解决方案基本上满足长度尺度约束,尽管后者可能在某些局部位置被违反。所提出的方法似乎很有前途,特别是注意到,解决方案,如果呈现完美的{ \it黑色和白色}与明确规定的最小长度尺度和边界平滑,是相当接近的性能相比,父拓扑结构。利用所提出的方法,获得{ \it体积分布}拓扑也是可能的,其中构件或多或少具有相同的厚度。
英文摘要:
Topology optimization using gradient search with negative and positive elliptical masks and honeycomb tessellation is presented. Through a novel skeletonization algorithm for topologies defined using filled and void hexagonal cells/elements, explicit minimum and maximum length scales are imposed on solid states in the solutions. An analytical example is presented which suggests that for a skeletonized topology, optimal solutions may not always exist for any specified volume fraction, minimum and maximum length scales, and that there may exist implicit interdependence between them. A Sequence for Length Scale (SLS) methodology is proposed wherein solutions are sought by specifying only the minimum and maximum length scales with volume fraction getting determined systematically. Through four benchmark problems in small deformation topology optimization, it is demonstrated that solutions by-and-large satisfy the length scale constraints though the latter may get violated at certain local sites. The proposed approach seems promising, noting especially that solutions, if rendered perfectly {\it black and white} with minimum length scale explicitly imposed and boundaries smoothened, are quite close in performance compared to the parent topologies. Attaining {\it volume distributed} topologies, wherein members are more or less of the same thickness, may also be possible with the proposed approach.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。