检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:高博[1,2] 阎艳[1] 张发平[1] 王国新[1]
机构地区:[1]北京理工大学机械与车辆学院,北京100081 [2]兰州交通大学机电学院,甘肃兰州730070
出 处:《北京理工大学学报》2015年第3期236-241,共6页Transactions of Beijing Institute of Technology
基 金:国家部委预研项目(513180102);国家自然科学基金资助项目(51105039)
摘 要:针对计算机辅助工艺设计中的装夹规划问题,提出一种面向制造特征的基于公差推理的装夹聚类规划方法.通过分析零件的制造过程,对加工单元进行定义,建立零件的装夹规划数学模型.随机生成装夹规划的初始解,计算加工单元之间的装夹相异度,通过进行反复迭代的聚类分析获取最少的装夹分组.基于公差的推理方法,获得加工单元的加工顺序约束关系,进行装夹的组间及组内排序,生成最优装夹规划方案.同时,基于CATIA设计平台实现了零件的装夹规划原型系统,通过实例对所提算法进行了验证.To deal with setup planning problems in computer aided process planning,a novel setup planning method based on clustering analysis and tolerance reasoning was proposed orienting to machining features.By analyzing manufacturing process of part,the machining units were defined and a mathematical model for setup planning was established.Initial solution of setup planning was randomly generated,and dissimilarity matrix of machining units was calculated.The minimum group was formed by iterative clustering analysis.By tolerance reasoning,sequence constraint of machining units was acquired and setup planning sequences within group and between groups were generated.The optimal setup planning was put forward.Based on CATIA design platform,setup planning prototype system was developed and the proposed algorithm was verified by an example.
分 类 号:TH164[机械工程—机械制造及自动化] TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.124