首页 | 官方网站   微博 | 高级检索  
相似文献
 共查询到18条相似文献,搜索用时 78 毫秒
1.
基于特征的产品装配序列自动规划研究   总被引:5,自引:0,他引:5  
以问题规约的求解策略,以分解法规划产生的装配序列,提出与或图表达装配体拆卸序列解空间。通过求解拆卸序列与或图的解空间得到装配体的拆卸序列,将拆卸序列反向得到装配序列。为降低装配体拓扑联接图的复杂度,对作业组件做识别,文中提出判断零件拆卸性的 3 个条件,大部分零件无需进行干涉检验,而由逻辑推理即可判断是否满足拆卸条件,每一成功拆卸操作对应于一个拆卸或装配序列,避免了多次试凑,有更高求解效率,可更广泛地用于装配序列求解上。  相似文献   

2.
针对复杂产品装配序列规划复杂度高、求解效率低下的问题,提出了基于典型零件装配语义规则的装配序列规划预处理方法。构建基于特征的装配语义模型,表达零件的类型与几何特征信息,在此基础上构建典型零件装配特征库;通过基于属性邻接图的匹配方法,进行零件类型识别及子特征分割;基于典型零件的装配规则,建立装配序列规划矩阵的降维方法,提出基于装配序列规划矩阵的装配可行序列生成方法;以主动锥齿轮子装配为例验证了方法的有效性。  相似文献   

3.
基于图分解的装配序列生成算法研究   总被引:5,自引:0,他引:5  
对装配序列生成中几种常用的方法进行了详细的探讨与比较 ,提出基于图分解的装配序列生成算法 ,并对图分解法中序列数随零件数剧增的问题 ,采用增加更多的可行性判断标准 ,利用闭环规则、超集规则和子集规则简化计算 ,并预先从部件层次图提取优选子装配体 ,从而使装配序列能够简单、准确、高效生成。  相似文献   

4.
装配序列生成中装配信息的表示方法研究   总被引:6,自引:0,他引:6  
白芳妮  李磊  魏生民 《中国机械工程》2002,13(14):1209-1211
提出采用表、矩阵、基于知识的联接关系图及其对应的关系矩阵、装配体层次关系树、局部阻碍有向图、稳定有向子图、装配知识规则这几种表示表示来完整、准确地表示装配序列生成时所需的装配信息,解决了装配序列生成中序列数随零件数增加而剧增的问题,使装配序列能准确、高效生成。  相似文献   

5.
基于图论和子装配识别,提出了装配序列规划方法.把有向图理论运用到装配建模,提出了用有向装配关联图来表示装配关系.通过对装配体的结构分析,定义了子装配体,并且将子装配体进行分类.然后通过于装配识别和有向图割集,实现了装配序列规划的生成.此方法比单独的有向割集计算量少、产生的序列少.最后将该算法运用到阀门装配体中,验证了其有效性.  相似文献   

6.
面向结构教学及维修人员培训,提出了一种基于零件几何约束关系同步解除的爆炸图自动生成方法。在定义零件拆卸轴向的基础上,建立了零件邻接拆卸约束关系矩阵及约束类型矩阵,按照可同步解除几何约束的顺序对零件进行分层,并利用判断规则识别子装配体。结合应用OBB和FDH两种包围盒,提出了一种"由外向内"的等速率分层牵引零件爆炸分离方法,实现了装配体组成零件爆炸图的自动生成。  相似文献   

7.
刘西  陈虎  张帅 《机械工程师》2015,(2):99-102
针对复杂产品的装配规划过程较为繁琐的难题,提出了一种基于子装配体的并行装配序列规划方法。将子装配体运用到序列生成的过程当中,通过对子装配体的识别,然后将识别后的零件进行并行序列规划,实现了优化装配序列的目的。通过实例验证,结果表明此方法比纯粹的并行化规划产生的序列少,简化了整个装配序列产生时所参与的零件数,简化了复杂产品的规划过程,提高了装配效率。  相似文献   

8.
首先对装配建模的深入研究,本文采用无向图的方法进行装配建模,主要包括了零件以及零件之间的装配联接关系。通过装配联接关系矩阵将装配模型中的装配关系信息转化成数学信息,并进一步给出了基础件的识别算法。一个装配体中往往包含多个子装配体,子装配体的正确识别可以提高装配操作的并行性。根据装配联接关系信息,本文提出了Ⅰ型子装配体、Ⅱ型子装配体的识别算法.并用实例进行了分析。  相似文献   

9.
装配规划是虚拟装配中的关键技术。这里将装配序列的分层规划方法和拆卸法求解装配序列的方法相结合,在研究产品装配层次结构的基础上,以子装配体为研究对象,利用零件之间的装配约束信息求解零件的拆卸方向和顺序,进而实现产品的装配顺序和路径规划。  相似文献   

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

11.
An important aspect of design for the life cycle is assessing the disassemblability of products. This paper presents a novel approach to automatic generation of disassembly sequence from hierarchical attributed liaison graph (HALG) representation of an assembly through recursively decomposing the assembly into subassemblies. In order to increase the planning efficiency, the HALG is built according to the knowledge in engineering, design and demanufacturing domains. In this method, the boundary representation (B-Rep) models are simplified by removing the hidden surfaces to reduce the computational complexity of disassembly planning. For each layer of HALG, the subassembly selection indices defined in terms of mobility, stability, and parallelism are proposed to evaluate the extracted tentative subassemblies and select the preferred subassemblies. To verify the validity and efficiency of the approach, a variety of assemblies including some complicated products are tested, and the corresponding results are presented.  相似文献   

12.
装配顺序生成是装配设计自动化中的一个重要而复杂的问题。本文在分析现有装配模型的基础上,引入虚拟子装配体的概念,提出了装配层状关系模型,采用割集法和与/或图产生可行装配顺序,给出了二级圆柱齿轮减速器装配工艺规划的应用实例。  相似文献   

13.
一种基于子装配体识别的装配顺序生成   总被引:2,自引:0,他引:2  
装配体表达为装配连接图,在识别子装配的基础上,给出了简化装配体装配顺序的确定方法。文中对子装配的识别原则和装配顺序、装配方向的确定等问题进行了详细的阐述。  相似文献   

14.
Assembly sequence planning is a typical of NP-complete problem which will spend a large amount of computation time or disk memory once the assembly becomes complex. The complex product or assembly is composed of many parts and the number of assembly relationships between them is numerous. To decrease the difficulty of assembly sequence planning of complex products, the subassembly identification methods are focused on. It aims to decompose a complex assembly into a limitative number of subassemblies. Each subassembly contains a relatively smaller number of parts and the assembly sequence planning tasks of them can be handled efficiently. The subassembly identification methods for assembly sequence planning are summarized with respect to assembly constraints. The assembly constraints including the topological, geometrical, and process constraints are considered and merged into the assembly models for subassembly identification. The assembly models are generally represented as directed or undirected assembly diagrams including these considered constraints. It is generally taken as the input information to generate appropriate subassemblies complying with the requirements. The graph theories and graph search algorithms, integer programming methods and the emerging techniques, such as the knowledge-based methods, the intelligent algorithms and the virtual technology, etc. are advocated to resolve the subassembly identification problem with respect to the assembly models. The hierarchical assembly tree is widely used to represent the results of subassembly identification. These useful methods are not only used to subassembly identification for assembly sequence planning, but also successfully referred to by product disassembly.  相似文献   

15.
基于模糊聚类的产品合理子装配划分   总被引:6,自引:0,他引:6  
将模糊数学中的一些概念和理论引入产品合理子装配的划分之中 ,提出了产品零件集合的直积空间上的模糊紧密度关系、模糊装配连接图、模糊装配矩阵、产品模糊聚类等概念 ,并给出了基于产品模糊聚类的产品合理子装配划分方法。  相似文献   

16.
An Intelligent Computer-Aided Assembly Process Planning System   总被引:5,自引:1,他引:4  
This paper presents an intelligent computer-aided assembly process planning system (ICAAPP) developed for generating an optimal assembly sequence for mechanical parts. The system employs a graph set technique for creating an assembly model. The set includes an attributed topological graph, an attachment constraint graph, a tolerance graph and a special process constraint graph. In the generation of assembly sequences for any product, the critical problems to be addressed include determining the base part, selection of subassemblies, defining all necessary constraints, and quantifying and solving these constraints. In the ICAAPP system, algorithms have been developed for the selection of the base part, defining of the subassemblies, and determination of the constraint values. A simple mechanical assembly is used to illustrate the feasibility of the proposed algorithms.  相似文献   

17.
Assembly sequences planning for simultaneous engineering applications   总被引:3,自引:2,他引:1  
This paper describes a Generative Assembly Process Planner (GAPP) used to generate and evaluate assembly sequence alternatives which can be used in simultaneous engineering applications. Given a graph model of the product to be assembled, optimal assembly sequences are automatically generated and evaluated in a single process. Geometric feasibility and accessibility constraints on assembly operations which help prune the search space are presented. Assembly-related criteria which guide the search to an optimal solution are described. These include: number of reorientations, concurrent execution of assembly tasks, grouping of similar tasks and stability criteria. The relative weights of various criteria can be varied interactively resulting in different optimal assembly sequences. The ability of GAPP to generate and evaluate assembly alternatives when various criteria are enabled or disabled or their relative importance is changed makes it an effective tool for simultaneous engineering/manufacturing applications. Examples are included to demonstrate GAPP's use and potential for assessing assembly, disassembly, repair and maintenance procedures.  相似文献   

18.
装配顺序规划是研究和开发计算机辅助装配工艺设计系统,实现产品装配设计过程和装配工艺设计过程有效集成的关键技术。研究了CAD模型中装配设计信息提取、子装配体识别法和拆卸法综合应用的装配顺序规划、基于装配结构树的装配设计与工艺集成数据接口的定义等相关技术。在这些研究的基础上,借助国产三维CAD平台CAXA的二次开发平台和XML技术,对以上技术进行了实现。最后,以电机产品为研究对象,给出了相关实例。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号