检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:贡林欢 左健民[2] GONG Linhuan;ZUO Jianmin(College of Mechanical Engineering, Jiangsu University, Zhenjiang, Zhenjiang Jiangsu 212000, China;Research Department of Intelligent Manufacturing Equipment,Nanjing Institute of Technology, Nanjing 210000, China)
机构地区:[1]江苏大学机械工程学院,江苏镇江212000 [2]南京工程学院智能装备研究院,南京210000
出 处:《机械设计与研究》2019年第2期79-82,共4页Machine Design And Research
基 金:江苏省产学研前瞻性联合研究项目(BY2016008-04)资助
摘 要:RV减速器装配精度要求很高,采用完全互换装配法不经济,寻找合适的选配方法值得研究。分组选配法滞装严重,且依赖待装零件的尺寸分布,而基于二分图匹配的选配方法具有匹配率高、算法易于实现等优点。首先对二分图匹配的基本定义和基本理论进行说明,介绍了二分图最大匹配的匈牙利算法,然后应用该方法完成RV20E型减速器的零部件选配。最后,利用数值模拟方法做了对比试验,结果表明二分图匹配比分组选配法的匹配率高6%至25%。为RV减速器的选配提供了新方法,该方法也可应用在其他精密零件装配领域。RV reducer has the characteristic of high assembly precision, interchangeable assembly method is uneconomical. Group matching model depends on the size distribution of parts and causes a large number of surplus parts, on the contrary, the selected assembly method based on bipartite graph maximum matching has the characteristics of high rate of matching and easy to realized on compute. In this paper ,the basic definitions and theory on bipartite graph matching are introduced , the bipartite graph maximum matching algorithm , the Hungarian algorithm ,is described and applied to a example. A test between group matching model and bipartite graph matching method is done, the result shows that the matching rate of bipartite graph matching method is 6% to 25% higher then that of the group matching model. The selected assembly method based on bipartite graph matching provides a new method on assembling RV reduce , which can also used on other fields.
分 类 号:TP122[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.14.7.99