检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:高博[1] 胡晓宇 彭珍瑞[1] 刘君泉 GAO Bo;HU Xiaoyu;PENG Zhenrui;LIU Junquan(School of Mechanical Engineering,Lanzhou Jiaotong University,Lanzhou,730070)
机构地区:[1]兰州交通大学机电工程学院
出 处:《中国机械工程》2019年第21期2539-2545,共7页China Mechanical Engineering
基 金:国家自然科学基金资助项目(51768035,61463028)
摘 要:针对计算机辅助工艺设计中的装夹规划问题,提出一种基于智能水滴算法的装夹规划方法。通过对加工特征进行分析来定义零件的操作单元及其约束关系,构建装夹规划的模型。将零件的各个操作单元与智能水滴算法中流动路径的各个节点相关联,利用水滴所携带的泥土量来表征操作单元之间的相似度,以此来构建智能水滴算法的适应度函数。在经过操作单元顺序约束矩阵所筛选出的可行解空间内进行迭代求解,通过水滴多次冲刷路径中的泥土量来筛选最优解,解码后获得了最优的装夹规划方案。以典型零件的装夹规划为例,验证了该方法的有效性和可行性。To solve the setup planning problems in CAPP,a novel setup planning method was proposed based on intelligent water drops(IWD)algorithm.By analyzing the machining features,the machining unit and its constraint relationships were defined,and the setup planning model was constructed.The machining units of the parts were associated with the nodes of the flow path in IWD algorithm,and then the similarity between machining units was characterized by the amount of soil carried by the water-drop,thus the fitness function of IWD algorithm was constructed.Iterative computation was carried out in the feasible solution space selected by the sequential constraint matrix of the machining unit.The optimal solution was obtained by the amount of soil in the path of water droplet scour for several times,and the optimal setup planning was obtained after decoding.Setup planning process of the typical parts was illustrated to prove the effectiveness and feasibility of the proposed method.
关 键 词:装夹规划 智能水滴算法 适应度函数 计算机辅助工艺规划
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.26