基于子装配识别的产品拆卸序列生成研究

对含有较多零件的复杂产品拆卸方法作了讨论,提出了一种基于子装配识别的拆卸序列生成算法。根据装配连接图和干涉图识别出子装配体,然后将子装配体看作一个零件,采用装配经验知识与几何推理相结合的方法生成子装配体序列,最后以一个装配实例说明了算法的有效性。     

A novel approach to the geometric feasibility analysis for fast assembly tool reasoning

A product assembly or disassembly is completed by means of proper tools. The selection of feasible tools is an important process in planning a complete assembly or disassembly sequence. A key tooling consideration in assembly or disassembly planning is to reason the available space for a tool application during the assembly or disassembly of a product. Currently, assembly tool reasoning about space mainly depends on simulation-based or user-interactive approaches because of its computational complexity. These approaches are inappropriate in dealing with various what-if scenarios regarding assembly or disassembly planning in a rapid product development. They also depend on users’ expertise or experience in assembly or disassembly. This paper presents a novel approach to the geometric feasibility analysis for fast assembly tool reasoning. Techniques described in this paper are advantageous not only in the aid of generating a complete assembly or disassembly plan but also in the efficient support of such systems as computer-aided assembly planning (CAAP), design for manufacturing (DFM), design for assembly (DFA), design for disassembly (DFD), and computer-aided tool selection (CATS).     

产品装配顺序规划方法的研究

计算机辅助装配顺序规划是有关产品装配研究的重要内容。在提高装配顺序规划质量的条件下，综合拆分法与优先约束法的优点，提出了一种装配顺序规划的新方法。在子装配、组件预识别的基础上，采用割集法将产品进行拆分。基于装配城信息建立零件几何优先关系，基于产品共性特征及个性特征建立工艺优先关系，最终生成合理可行的装配顺序，并对实例进行分析。     

基于零件约束的装配规划技术研究

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

几何增强的装配工艺本体建模

包含产品几何与非几何信息的产品装配要求是装配工艺设计的主要依据,对装配工艺设计决策结果具有决定性的影响。在装配工艺模型中描述产品的几何相关信息能够更好地表达如装配顺序,装配路径等内容,同时可以更好地辅助装配工艺决策,提高决策的自动化水平。提出一种几何增强的装配工艺本体模型,利用语义本体技术,建立产品几何信息在装配工艺中的描述方法,数据结构与关系描述。并以该模型为基础,建立基于几何增强装配工艺本体的装配工艺决策框架。该框架分为两部分：一是采用几何增强的装配工艺本体模型描述产品几何信息和装配工艺信息的数据结构和相互关系;二是为了让几何信息与装配工艺信息之间存在的丰富的隐含关系显性化,对语义本体推理机制进行增强,提出推理单元的概念,使决策框架具有从产品几何信息中推理装配工艺相关信息的能力,有效地支持装配工艺决策。以针对某传动器产品装配顺序决策的过程,验证所提出的几何增强装配工艺本体模型与框架的有效性。     

基于知识的装配序列规划方法研究

为了解决装配序列规划的计算机辅助生成问题,对产品的装配CAD模型进行了分析,得到与装配规划相关的几个重要信息,并对其进行知识表示。通过建立产品的装配特征矩阵,确定了装配零、部件在各个方向的自由度。根据从CAD模型中得到的信息和零、部件的自由度信息,制定了产品拆卸序列规划的推理规则和求解算法;按照“可拆即可装”的原则,倒置拆卸序列得到产品的装配序列。以球阀产品为例,详细介绍了本文提出的装配序列规划方法的应用。     

基于工程语义信息的拆卸序列规划算法研究

为了解决拆卸序列规划理论算法存在的求解空间过大的问题,提出一种基于工程语义信息的规划算法.该算法借助装配约束条件、拆卸干涉状况等工程信息,实施产品拆卸顺序生成和路径推理,直接排除从工程角度不可能的拆卸序列,达到缩减求解空间的目的.保证了算法同工程实际的一致性,提高了其实际应用和软件编程能力.     

A converse method-based approach for assembly sequence planning with assembly tool

In order to improve the quality and efficiency of assembly sequence planning for complex mechanical product, a converse method-based approach for assembly sequence planning is proposed. Firstly, the disassembly interference matrix of product and the disassembly constraint degree of part are defined. Product disassembly sequence is obtained through geometry reasoning algorithm and the searching work of disassembly sequence is simplified by the contact constraint set. Secondly, the maneuverability of tool is inspected through the using matrix and interference matrix of assembly tool. The infeasible disassembly sequence is excluded and product assembly sequence is obtained by reversing the order of disassembly sequence. Thirdly, the evaluation mechanism for assembly sequence is established to get the optimal assembly sequence and the optimal assembly sequence is selected by calculating the value of evaluation function. Finally, a vibration generator is illustrated to verify the validity and feasibility of the proposed approach.     

基于质量特征产品装配顺序规划的逆向推理算法探究

在Petri网柔性装配系统装配顺序规划中引入装配质量要素,并以装配零件的装配自由度,装配作业后稳定性,装配零件配合精度对装配质量的影响作为基本因子,提出装配质量置信度概念,解决柔性装配系统装配规划中装配质量及其定量化问题。根据装配形成的产品在Petri网装配状态图中表示为一个最终库所的特点,应用改进B树模型,提出仅以变迁信息的产品装配顺序规划Petri网逆向推理算法,简化装配顺序规划推理过程,对于多个变迁均可生成最终成品的情况,亦给出装配顺序规划的解决方案,并以摩托车发动机的装配为例,证明该算法是可行的。     

Product cooperative disassembly sequence planning based on branch-and-bound algorithm

This paper focuses on the cooperative disassembly sequence planning (CDSP) problem which is essential to disassembly a large and complex product in practice. A disassembly hybrid graph model (DHGM) is constructed to describe the mating contact and noncontact priority relationships among constituting product components. Thus, the disassemblability constraint expression can be deduced from it by reasoning. The CDSP is different from the disassembly sequence planning except for they are NP-complete. Therefore, a novel method is presented to generate cooperative disassembly hierarchical tree (CDHT) from the DHGM based on branch-and-bound algorithm in which two user-defined variables are introduced to control the size of the CDHT .The optimal solutions with a minimal disassembly time are derived according to the objection function. Finally, an example illustrates the proposed method.     

An intelligent interactive approach for assembly process planning based on hierarchical classification of parts

Assembly process planning is a difficult problem in the product design and development process. In order to reduce the difficulty of assembly process planning (APP), this paper presents an approach to finding a practical plan for assembly process through the intelligent interactive method based on hierarchical classification of parts. First, two hierarchical classification principles towards interactive disassembly are presented based on the key assembly constraint (KAC). Then, the initial assembly relationship of the product is readjusted to a new hierarchical structure which is more suitable for assembly planning according to a novel hierarchical classification algorithm. On the basis of the new hierarchy of product, an intelligent disassembly-based approach is presented, which not only takes full advantage of the ant colony algorithm for searching and constructing an initial assembly sequence with three available assembly principles, but also makes full use of the experience and knowledge of the human being for achieving a better assembly process. The intelligent disassembly approach can achieve an optimized assembly sequence, paths and scheme necessary information regarding the required assembly fixtures and tools. Finally, a case study shows that the proposed approach is feasible and practical.     

基于遗传算法的产品装配序列规划研究

为解决产品实际装配过程装配序列规划的问题,建立了描述装配过程中零部件间装配关系的几何干涉关系矩阵。设计了以装配换向次数、装配工具更换次数、装配体稳定性和基础件位置为目标函数的遗传算法,并改进了该遗传算法相应的交叉算子、变异算子和适应度函数,以确保算法的有效性。在初始种群生成时,输入由DELMIA软件虚拟拆卸得到的几何可行装配序列,改善种群的组成成份。将该遗传算法应用于某链轮的装配序列规划中,验证了该算法的有效性。     

A green assembly sequence planning model with a closed-loop assembly and disassembly sequence planning using a particle swarm optimization method

In a green product life cycle, it is necessary to determine how to disassemble a product before the product is planned to be assembled. In this research, a green assembly sequence planning model is developed. A closed-loop assembly sequence planning model is presented by integrating assembly and disassembly sequence planning models. For an assembled product, an assembly sequence planning model is required for assembling the product at the start, while a disassembly sequence planning model is performed for disassembling the product at the end. In typical assembly and disassembly sequence planning approaches, the two sequences are independently planned and evaluated. In this paper, a closed-loop model is presented to concurrently generate and evaluate the assembly and disassembly sequences. First, a graph-based model is presented for representing the feasible assembly sequences and disassembly sequences. Next, a particle swarm optimization (PSO) method with a new encoding scheme is presented. In the PSO method, the assembly and disassembly sequences can be simultaneously represented and evaluated with an objective of minimizing the total of assembly costs and disassembly costs. The test results show that the presented method is feasible and efficient for solving the integrated assembly and disassembly sequence planning problem. An example product is illustrated and discussed.     

复杂产品并行拆解建模及规划方法研究

为提高复杂产品并行拆解的效率,提出了一种针对复杂产品的并行拆解建模及规划方法。通过构建拆解约束图确定零件之间的连接关系,利用传递闭包算法进行聚类分析,将产品分解为若干个组件的集合。提取组件与组件之间的连接零件集合,利用人工蜂群算法对连接零件集合以及每个组件分别进行拆解规划,从而得到复杂产品的并行拆解模型及规划序列。以摩托车发动机的并行拆解为例,对该方法进行了验证,结果表明该方法能有效地实现复杂产品的并行拆解,提高复杂产品的拆解并行度和拆解效率。     

面向可装配性评价的零件插装方向自动提取方法

零件插装方向是影响产品可装配性的主要特征之一,其自动化提取对于提高可装配性评价的效率具有重要意义。本文提出了一种面向机器人装配的可装配性评价的零件插装方向自动化提取方法,根据给定的产品装配序列及计算机辅助设计信息,运用几何推理技术判断产品零件间的装配关系,建立产品装配关系模型,并基于自由度分析导出零件插装方向。     

Disassembly modeling, planning, and leveling for a cam-operated rotary switch assembly: a case study

The manufacturing organizations have been witnessing a paradigm shift on designing products and services from manufacturing to sustainability. Product disassembly is a vital strategy for industrial recycling and remanufacturing which generates the desired parts and/or subassemblies by means of separation of a product into its elements. This article presents the appropriate methods for modeling planning and leveling the disassembly process of a cam-operated rotary switch assembly. The methodology involves disassembly modeling using a graphical approach. Disassembly process planning has been done using reverse assembly approach. Disassembly leveling has been done to maintain profitability and environmental features at a desired level. An optimal disassembly sequence has been derived using disassembly leveling. The resultant cost of disassembly for reusable components has been computed. The article presents a unique contribution to the field of designing for disassembly from the perspective of rotary switches.     

Efficient method of assembly sequence planning based on GAAA and optimizing by assembly path feedback for complex product

In the process of complex product assembly, assembly resources (fixtures, tools, operations, and so on) must enter assembly environment with parts together to rapidly finish product assembly. Assembly planning must take assembly resources into account fully. But, designer cannot plan every assembly procedure because of the lack of assembly resources during assembly design. Then, it will cause assembly failures and redesign for assembly easily. This paper investigates an efficient method of assembly sequence planning based on genetic algorithm and ants algorithm (GAAA) and optimizing by assembly path feedback to assembly process planning including assembly resources for complex products. Firstly, a new GAAA is investigated to rapidly plan assembly sequence in order to solve the nondeterministic polynomial-bounded problem in high searching and solving efficiency. Secondly, on the basis of the assembly sequence, a B-Rep filling algorithm which can form a swept volume between the part and its kinetic orientation is developed to plan assembly path interactively. Thirdly, the performance of the assembly path according to the assembly sequence is analyzed and sent back to avoid the most of assembly collisions and interventions during product assembly design. Lastly, we develop a simulating system to simulate assembly sequence and path based on component application architecture for CATIA V5. The simulating result proved that the proposed method of assembly sequence planning based on GAAA and optimizing by assembly path feedback for complex products is efficient. Assembly optimal design including assembly resources can work well.     

柔性装配系统设计的研究

对柔性装配系统设计中的装配顺序规划和机器人装配站规划进行了研究。装配体所有的分解方式可通过计算装配体零件接触关系的割集来实现，然后利用分离可行性和可行分离路径二条判来判断哪 些拆卸方式是可行的，重复上述分解过程，直到单个零件。     

基于VRML的机械产品虚拟装配技术研究

简要介绍了VRML语言定义、特点,阐述了机械零部件虚拟建模方法。对虚拟装配流程进行分析,并对产品装/拆运动的表示形式、虚拟装配路径规划及逻辑控制、虚拟装配过程中的碰撞检测方法等关键技术进行了研究,提出了产品装/拆运动12元组表示形式。最后,通过对机械产品交互式虚拟装配进行实例仿真,验证了该技术的可行性和合理性。     

产品装配分析环境的构建

采用Visual C 编程语言,在现有CAD系统的基础上,以Object ARX为开发工具,建立了产品装配分析系统基本结构,可直观演示人机交互拆、装过程,分析装配几何体设计中的缺陷,提取相关装配特征信息,进行装配顺序分析和工艺规划。在Open Inventor虚拟现实软件开发包的基础上,开发了虚拟装配环境,构建了虚拟装配系统的结构框架,实现了从CAD环境到虚拟装配环境产品几何模型数据的传递,演示了产品在虚拟环境下的拆卸过程。