基于扩展干涉矩阵的几何可拆卸性判别方法

零部件的几何可拆卸性(Geometric dismountability,GD)是基于以拆卸序列求装配序列策略的装配序列规划的前提,干涉矩阵是对其进行判别的重要装配关系模型。为解决零部件在非标准正交轴向上的GD判别难题,提出扩展干涉矩阵(Extended interference matrix,EIM)模型,将现有干涉矩阵结构扩展到零部件局部坐标系轴向。为了便于分析具有复合拆卸路径方向的零部件GD,提出转折式干涉矩阵(Turning interference matrix,TIM)模型,以紧凑的结构描述转折点处完备的干涉信息。为了快速、准确地获取干涉矩阵,提出步进式精检测、基于包围盒的粗检测和加速式检测等自动检测方法,以及静态硬干涉自动屏蔽法。基于EIM和TIM,提出更全面的零部件GD判别算法及流程。开发基于UG NX的全自动装配规划系统AutoAssem,以实例验证各干涉检测措施的有效性,说明EIM和TIM丰富了拆卸方向的多样性和可变性,使GD判别具有面向复杂产品的通用性,为后续序列规划算法提供了有效依据。     

基于递归循环的层次化爆炸图自动生成方法

提出以递归循环和深度优先搜索层次化装配序列的策略自动生成复杂产品层次化爆炸图的方法。为使设计结构符合装配规划的要求,设计了可方便定义子装配体和编辑装配树的装配结构重构功能。为避免重复的干涉检测,研究干涉矩阵合成方法,通过对原始装配关系信息的整合,柔性化生成面向层次化结构的装配关系矩阵。为降低大规模序列规划问题的复杂性,将整体规划任务分解为若干个及若干层级子任务,子任务内采用多规则筛选算法,以基于干涉矩阵的几何可行性为前提,并行性、连续性、稳定性和方向性等为优化筛选指标,循环构建序列。提出递归爆炸算法,循环对层次化装配序列进行深度优先搜索,实时计算已爆炸零部件的累积包围盒,从而确定待爆炸零件位移矢量,自动生成间隔均匀有序、结构紧凑且空间层次感强的爆炸图。开发了基于Siemens NX的装配规划系统Auto Assem,以减速器及汽车部件实例验证了方法的有效性。     

多工位装配序列粒子群优化算法

针对传统单工位装配序列求解上的不足,将粒子群算法应用于多工位多目标装配序列优化的求解,提出一种面向复杂多工位产品的装配序列优化方法。采用优先序列图(Assembly precedence graph,APG)来描述零件间的优先约束关系,构建优先关系矩阵、装配干涉矩阵、工位能力表和装配信息表,描述装配部件干涉及工位之间的关系;给出粒子群算法编码体系和装配关系算法模型表达方法;综合考虑装配操作成本、装配工具更换成本和装配夹装变更成本和运输成本的影响,提出有工程意义的适应度函数的表达式;根据APG生成随机的可行初始装配序列,并利用粒子群算法(Particle swarm algorithm,PSO)对装配序列和装配工位进行优化。以飞机起落架装配序列规划实例验证多工位粒子群装配序列优化算法有效性。     

A max–min ant colony system for assembly sequence planning

An improved ant colony optimization (ACO)-based assembly sequence planning (ASP) method for complex products that combines the advantages of ant colony system (ACS) and max–min ant system (MMAS) and integrates some optimization measures is proposed. The optimization criteria, assembly information models, and components number in case study that reported in the literatures of ACO-based ASP during the past 10 years are reviewed and compared. To reduce tedious manual input of parameters and identify the best sequence easily, the optimization criteria such as directionality, parallelism, continuity, stability, and auxiliary stroke are automatically quantified and integrated into the multi-objective heuristic and fitness functions. On the precondition of geometric feasibility based on interference matrix, several strategies of ACS and MMAS are combined in a max–min ant colony system (MMACS) to improve the convergence speed and sequence quality. Several optimization measures are integrated into the system, among which the performance appraisal method transfers the computing resource from the worst ant to the better one, and the group method makes up the deficiency of solely depending on heuristic searching for all parallel parts in each group. An assembly planning system “AutoAssem” is developed based on Siemens NX, and the effectiveness of each optimization measure is testified through case study. Compared with the methods of priority rules screening, genetic algorithm, and particle swarm optimization, MMACS is verified to have superiority in efficiency and sequence performance.     

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

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

装配规化中零件装配方向倾斜时拓扑信息的处理

零件的装配方向倾斜时,需要进行空间坐标变换,使零件的装配方向与变换后的坐标方向相同或相反。本文的目的就是给出新旧坐标体系下的变换矩阵,在倾斜的坐标体系下实现对零件间干涉和接触的判断,并对零件的接触类型进行了分类,最后利用软件实现了产品装配网络模型的自动生成。     

基于最大-最小蚁群系统的装配序列规划

提出一种结合了蚁群系统与最大-最小蚂蚁系统优点的装配序列规划(Assembly sequence planning, ASP)方法。对近十年基于蚁群优化的ASP文献中采用的优化指标、装配信息模型、实例零件数等进行综述和比较。为提高序列的装配效率区分度,研究方向性、并行性、连续性、稳定性和辅助行程等5项指标的自动量化方法,将其融入到蚁群优化多目标启发式函数和适应值函数中。为提高对最优序列的搜索能力,以装配几何可行性为基础,从蚂蚁数量的确定、最大-最小信息素的界定、初始零件分配位置的绩效考核机制以及对并行零件组强制优化机制等方面,设计针对性解决方案,提出基于最大-最小蚁群系统的ASP算法。开发基于Siemens NX的装配规划系统AutoAssem。以阀门为实例,验证了算法内部各项优化措施的有效性,同时与优先规则筛选法、遗传算法及粒子群算法进行比较,分析该算法在运行效率和序列性能方面的优势。     

Computer aided geometric feasible assembly sequence planning and optimizing

Assembly sequence planning (ASP) is the foundation of the assembly process planning and design for assembly (DFA). In ASP, geometric feasibility is the prerequisite in the valid assembly sequences searching. The assembly precedence relations’ (APRs) deriving and fulfilling are the essential tasks in the geometric feasible assembly sequence planning. In this paper, a systematical approach called geometric constraint analysis (GCA) is proposed and the corresponding software system is developed and integrated with CAD system. Using this system, only with a few mouse clicks on CAD draft, assembly precedence relations (APRs) can be derived correctly and completely. Then, all the geometric feasible assembly sequences can be inferred out automatically. Moreover, an optimal algorithm is designed and realized in the GCA method, by which, the most optimal assembly sequence in terms of the operation convenience can be found out from the immense geometric feasible sequences. An erratum to this article can be found at     

基于同步约束解除的零件爆炸图自动生成方法

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

基于关系矩阵的装配骨架模型构建研究

为了实现自顶向下的设计方法,分析了以往研究的不足,从便于计算机表达的角度,引入装配语义组成关系矩阵和装配形状特征之间的装配关系矩阵,记录装配体的各装配形状特征组成和各装配形状特征相互之间的装配关系,以便在设计过程中将设计意图和装配约束自动向下游传递(从骨架模型向零件属模型传递)。     

An approach to multi-criteria assembly sequence planning using genetic algorithms

This paper focuses on multi-criteria assembly sequence planning (ASP) known as a large-scale, time-consuming combinatorial problem. Although the ASP problem has been tackled via a variety of optimization techniques, these techniques are often inefficient when applied to larger-scale problems. Genetic algorithm (GA) is the most widely known type of evolutionary computation method, incorporating biological concepts into analytical studies of systems. In this research, an approach is proposed to optimize multi-criteria ASP based on GA. A precedence matrix is proposed to determine feasible assembly sequences that satisfy precedence constraints. A numerical example is presented to demonstrate the performance of the proposed algorithm. The results of comparison in the provided experiment show that the developed algorithm is an efficient approach to solve the ASP problem and can be suitably applied to any kind of ASP with large numbers of components and multi-objective functions.     

INTEGRATED APPROACH TO GENERATION OF PRECEDENCE RELATIONS AND PRECEDENCE GRAPHS FOR ASSEMBLY SEQUENCE PLANNING

An integrated approach to generation of precedence relations and precedence graphs for assembly sequence planning is presented, which contains more assembly flexibility. The approach involves two stages. Based on the assembly model, the components in the assembly can be divided into partially constrained components and completely constrained components in the first stage, and then geometric precedence relation for every component is generated automatically. According to the result of the first stage, the second stage determines and constructs all precedence graphs. The algorithms of these two stages proposed are verified by two assembly examples.     

基于Pro/E的扣板模具设计与制造

文章叙述了扣板塑件的注射成型工艺分析,扣板模具的Pro/E模具设计、模具的虚拟装配干涉检测,模具零件加工工艺分析,复杂模具零件的数控加工程序的自动生成、加工仿真等。     

Error detection and recovery in flexible assembly systems

This study investigates error detection and recovery for flexible assembly systems. A method for error recovery based upon an expert system is presented. An expert system is used to control the assembly cell, but the robot controller controls the assembly operation. This ensures adequate speed of the assembly cycle. The robot signals the expert system when an error occurs. It determines the cause of the error and recommends a preprogrammed recovery procedure to correct the error automatically. The system is flexible and new error recovery routines are easily added to the system. The proposed method was implemented in the Mark II assembly cell at 1VF-KTH in Stockholm. The reliability of the assembly cell increased considerably after installation of the error detection and recovery system. The error detection did not affect the cycle time and error recovery took less than 10 seconds on average.     

CAD model simplification for assembly field

This paper aims to investigate a CAD model simplification method with appearance and assembly feature preservation in order to demonstrate and interact with the virtual assembly process of complex product efficiently. Firstly, the invisible features of current-assembled-state assembly model are detected and removed by pre-rendering the assembly model from multiple view directions to reduce data volume and preserve the appearance. Subsequently, the notion of “conjugation” is incorporated into the definition of assembly features to guide assembly feature recognition. The attributed adjacency graphs (AAGs) of the simplified current-assembled-state assembly model and to-be-assembled components are established. Then, the assembly features on currently selected to-be-assembled component are automatically recognized by searching conjugated subgraphs between the AAG corresponding to currently selected to-be-assembled component and other AAGs based on improved subgraph isomorphism algorithm. After that, simplified CAD model of the to-be-assembled component with its assembly features preserved is constructed by suppressing the common form features, so that it can complete assembly process fluently with the current-assembled-state assembly model. Finally, this method is applied successfully to several cases and the result shows its feasibility and superiority.     

A model-based approach to assembly sequence planning

This paper presents a systematic approach for automatic assembly sequence planning (ASP) by using an integrated framework of assembly relational model (ARM) and assembly process model (APM), which are established by object-oriented method. ARM, consisting of assembly, components and liaisons, is the static model of assembly to describe the geometric relationships between components in terms of contact, constraint and interference matrixes. APM, containing states and sub-processes, is the dynamic model of assembly to represent all potential alternatives in assembly process. An algorithmic procedure is also presented by which APM of an assembly can be constructed systematically by analyzing states from lower levels to higher levels. Through the procedure, all feasible sequences of a product can be generated, and the optimum one can be determined by further evaluating each sequence. To explain the approach more clearly, a practical assembly with five components is used as an illustration in the paper.     

二次开发UG实现飞机操纵系统零件参数化设计与虚拟装配自动化

在对飞机硬式机械操纵系统组件功能和构造特点分析以及零件实体造型和参数化模型建立的基础上,采用UG二次开发工具UG/Open编程,通过编辑不同类型零件参数化模型的几何特征参数实现零件参数化设计;针对UG交互方式进行大型复杂系统虚拟装配存在的操作过程烦琐和重复性差等不足,基于已建立的零部件装配用方位参照信息开发实现装配过程中的零部件自动坐标定位并对虚拟装配过程加以记录,实现虚拟装配自动化。     

Automatic generation of robotic assembly sequences

This paper describes a programming system capable of automatically generating robotic assembly sequences. It is a generative robotic assembly process planner. A geometric model of the product to be assembled is defined interactively in the feature-based product database. Assembly relationships between components are modelled interactively in the graphical relation diagrams. An initial and a final relation diagram are used to describe the initial and final states of the assembly, respectively. The validity of the physical connections defined in the final relation diagram is checked by analysing the information contained in the feature-based product database A single robotic assembly sequence is generated automatically, using only the relational data defined in the final relation diagram. Subassemblies are generated automatically. The component (or subassembly) to be moved at each step of the sequence is also explicity provided in the assembly-sequence formulation.     

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.     

A force/stiffness compensation method for precision multi-peg-hole assembly

In interference fit assembly, the magnitude and deviation of the assemble force are large so that it is hard to reach high accuracy of position for components of multiple parts stacked up. A force/stiffness compensation method is proposed to control the positioning accuracy in the interference fit assembly for multi-peg-hole components. Based on the force and displacement information measured in the assembly process, the position errors are acquired, and the stiffness of the assembly system under the exerted assemble force is calculated. According to the stiffness, the deviation from the target position is calculated and compensated. An experimental equipment based on this method was developed. As an example, assembly of rings, 6.2 mm in diameter and 0.25 mm in thickness, was carried out to demonstrate the feasibility of the proposed method. The assembly results show that high positioning accuracy of the assembled rings can be achieved with a large variation of assembly force. The presented method provides a simple, feasible, and efficient solution for interference fit assembly for multi-peg-hole components.