检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:宋小文[1] 潘兴兴[1] 冯坤[1] 周伟东[1]
出 处:《计算机集成制造系统》2013年第6期1249-1255,共7页Computer Integrated Manufacturing Systems
摘 要:针对实际拆卸过程中可能遇到的零件不可拆问题,为提高拆卸效率、降低拆卸成本,提出了面向零件不可拆的复杂产品拆卸序列规划方法。为更好地表达产品拆卸信息,构建了拆卸混合图模型;为产生新拆卸方案,提出了模型重构方法,该方法通过构建已拆卸零部件集、受影响零部件集、子受影响零部件集来实现模型的更新;根据目标拆卸体的可拆卸性,并结合拆卸序列优化算法来产生具体的拆卸方案和拆卸序列。以洗衣机为例对所提方法进行了验证,结果表明该方法较好地解决了零件不可拆问题,产生了切实可行的拆卸方案和拆卸序列,降低了拆卸成本、提高了拆卸效率和拆卸安全性。In view of the fact that some parts were unable to be disassembled in process of removing components from an electromechanical product, a Disassembly Sequence Planning (DSP) approach oriented to defective parts was proposed to improve the disassembly efficiency and to reduce the cost. Disassembly hybrid-graph model was constructed to describe the constraints of a product. A method of Model Re-Built (MRB) was presented to generate new disassembly sequence after constructing Set of Disassembled Parts (SDP), Set of Affected Parts (SAP) and Sub-Sets of Affected Parts (SSAP). The optimum sequence and approach for disassembly were generated according to the de- tachability of components combined with a disassembly sequence optimization algorithm. A case study of washing machine demonstrated that the proposed method could solve the unable disassembly problem better. The disassem- bly scheme and disassembly sequence were generated by this method, and the disassembly cost was reduced, the dis- assembly efficiency as well as the disassembly security were improved.
关 键 词:拆卸混合图模型 零件不可拆卸性 模型重构 拆卸序列规划
分 类 号:TH122[机械工程—机械设计及理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.112