Compliant mechanism 0-1 variable configuration type topology graph extraction method

Abstract

The invention discloses a compliant mechanism 0-1 variable configuration type topology graph extraction method, comprising the steps of establishing a first layer compliant mechanism topology optimization model; optimizing the topology optimization model and extracting a topology graph containing middle units; further optimizing the compliant mechanism topology optimization model containing the middle units and extracting a compliant mechanism 0-1 topology graph; establishing a next layer compliant mechanism topology optimization model, optimizing the model, gradually approximating the optimum resolution in a mode of continuously increasing a volume constraint value of the topology optimization model, and finally extracting an ideal compliant mechanism 0-1 variable configuration type topology graph satisfying target volume. According to the method, a volume constraint prolongation method is employed; the optimum resolution is gradually approximated in the mode of continuously increasing the area constraint value of the topology optimization model, all possible units are reserved to the greatest extent, and the compliant mechanism 0-1 variable configuration type topology graph is extracted.

Description

technical field [0001] The invention belongs to the technical field of topology map extraction in the topology optimization design of a compliant mechanism, and in particular relates to a method for extracting a 0-1 variable configuration topology map of a compliant mechanism. Background technique [0002] With the rapid development of microelectromechanical systems, micromachining and micromanipulation, and new materials, the design of compliant mechanisms has become a research hotspot in the field of mechanism science at home and abroad. [0003] Using the topology optimization method to study the design of the compliant mechanism only needs to give the design domain and specify the input and output positions, and does not need to start from a known rigid mechanism, and the obtained mechanism has the superior performance of distributed flexibility, which has attracted great attention. . [0004] This method is usually based on finite element analysis. In the initial stage...

AI Technical Summary

Problems solved by technology

It obtains the optimal solution by gradually removing invalid materials. Its advantage is that it does not need to introduce too many mathematical theories. However, since this method belongs to the category of integer programming, the continuity of sensitivity is poor, and the removed units cannot be used again. Therefore, Calculation efficiency is low, and it is easy to cause the result to not converge

On this basis, a two-way progressive method was developed. This method aims to remove invalid materials while adding effective materials to improve the convergence effect. However, this method is still an integer programming in essence, and cannot accurately evaluate all Sensitivity of Added Material Elements

In addition, there are methods combining simulated annealing and SIMP, and unit connection parameterization methods. Judging from their optimization results, it is still impossible to extract the ideal 0-1 topology.

Moreover, the above methods have the common disadvantage of easily leading to checkerboard

[0009] In addition, the topology optimization method based on level set is also an effective method to solve the problem of intermediate units, but this method also has defects such as initial sensitivity, inability to generate new holes, low computational efficiency, and difficulty in converging to non-smooth corners. Although some improved methods have been proposed, these problems have not been fully resolved

Images