Generic Approach for the Generation of Symbolic Dimensional Variations Based on Gröbner Basis for Over-constrained Mechanical Assemblies

2015 
Abstract This paper presents a generic approach, to generate symbolic dependency relations between the variations on the dimensional parameters for a family of over-constrained structure. We call structure a set of rigid parts interconnected together with mechanical linkages. A structure is over-constrained when the size of parts are not independent of each other. To achieve our goal, we propose the following method. Firstly, parameters are divided into two categories: dimensional parameters and configuration parameters. Dimensional parameters represent the size of the parts and configuration parameters represent the relative position between the parts. Symbolic closed-loop equations model the geometric problem. They represent the dependency between two types of parameters. To generate symbolic equations under dimensional parameters, we use a generic method of elimination, based on Grobner basis computation. These symbolic relations are called “compatibility equations”, which guarantee the existence of the studied mechanical assembly. Generally, there are many more dimensional parameters than compatibility equations. In this paper, compatibility equations are regarded as implicit functions. We apply the implicit function theorem to generate symbolic differential equations which govern the variations of the clearance between the components. For that, the set of dimensional parameters is separated into two subsets: independent and dependent dimensional parameters. Maximum and minimum clearances are calculated by simulating harmonic variations of the rigid parts size. The solution of the differential equations allows a fast simulation. The presented generic approach is applied on a 2D over-constrained assembly. Symbolic and numerical results show the feasibility of this generic approach.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    17
    References
    2
    Citations
    NaN
    KQI
    []