• CN：11-2187/TH
  • ISSN：0577-6686
机械工程学报

›› 1994, Vol. 30 ›› Issue (4): 36-41.

• 论文 • 上一篇    下一篇

扫码分享

装配顺序的与或图生成算法研究

徐家球;汪劲松;邱述斌;张伯鹏   

  1. 清华大学
  • 发布日期:1994-07-01

RESEARCH ON ASSEMBLY SEQUENCES GENERATION ALGORITHM USING AND/OR GRAPH

Xu Jiaqiu;Wang Jinsong;Qiu Shubin;Zhang Bopeng   

  1. Qinghua University
  • Published:1994-07-01

摘要： 装配顺序生成是装配工艺与规划的重要研究课题之一。本文提出了采用与或图生成产品顺序的算法，它对产品的关联图进行割集运算，生成相应的子装配，经干涉性、稳定性和紧固性分析后，用与或图描述其全部合理可行的拆卸顺序，并以其逆顺序作为装配顺序。最后，本文给出了一个生成罩极电机装配顺序的实例。

关键词: 割集, 关联, 与或图, 装配

Abstract: The assembly sequences generation in the field of assembly planning is a important subject. A sequences generation algorithm based on and/or graph is presented. The relation graph, cut-set are used for generating sub-assembly. After analysis on interference, stability and fastening, a and/or graph can be generated and the all disassembly sequences can be found in the graph. Taking the inversion of the sequences and optimizing them, the available assembly sequences will be obtained. Finally, a sample is given.

Key words: And/or graph, Assembly, Cut-set, Relation graph

版权所有 © 2019 《机械工程学报》编辑部 | 京ICP备05055788号-30