Computational path planner for product assembly in complex environments

Assembly path planning is a crucial problem in assembly related design and manufacturing processes. Sampling based motion planning algorithms are used for computational assembly path planning. However, the performance of such algorithms may degrade much in environments with complex product structure, narrow passages or other challenging scenarios. A computational path planner for automatic assembly path planning in complex 3D environments is presented. The global planning process is divided into three phases based on the environment and specific algorithms are proposed and utilized in each phase to solve the challenging issues. A novel ray test based stochastic collision detection method is proposed to evaluate the intersection between two polyhedral objects. This method avoids fake collisions in conventional methods and degrades the geometric constraint when a part has to be removed with surface contact with other parts. A refined history based rapidly-exploring random tree (RRT) algorithm which bias the growth of the tree based on its planning history is proposed and employed in the planning phase where the path is simple but the space is highly constrained. A novel adaptive RRT algorithm is developed for the path planning problem with challenging scenarios and uncertain environment. With extending values assigned on each tree node and extending schemes applied, the tree can adapts its growth to explore complex environments more efficiently. Experiments on the key algorithms are carried out and comparisons are made between the conventional path planning algorithms and the presented ones. The comparing results show that based on the proposed algorithms, the path planner can compute assembly path in challenging complex environments more efficiently and with higher success. This research provides the references to the study of computational assembly path planning under complex environments.     

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.     

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

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

Assembly sequences merging based on assembly unit partitioning

Assembly sequence planning is a typical of combinatorial optimization problem which is difficult to be tackled when the number of parts of assembly becomes large. To reduce the searching space of assembly sequence planning of complex products, assembly sequences merging based on assembly unit partitioning is suggested. Assembly unit partitioning is presented to decompose the complex products into a group of assembly units containing a reduced number of parts or components, and the assembly design constraints and the assembly process constraints are comprehensively taken into account. The global optimal assembly sequences can be acquired through three steps. Firstly, the assembly units and decision graph of assembly unit are generated utilizing fuzzy analytical hierarchy process approach. Secondly, the optimal or near-optimal subsequences of assembly units can be obtained with current efficient methods of assembly sequence planning. Thirdly, under the assembly interference of assembly relations (geometrical constraints) of the whole products and the assembly precedence concluded by subsequences of assembly units, the assembly sequence merging is implemented to generate the global assembly sequences, and the optimal sequence is obtained through assembly sequences evaluation. The assembly constraints considered at the two previous steps is represented by the evaluation function. The effectiveness of the method is verified by an illustrative example and the results show that the searching space of assembly sequence merging of complex products is reduced remarkably and the optimal assembly sequence of the whole produces is obtained.     

生成装配与或图的直接算法

为了提高产品装配序列规划的效率,提出一种生成装配与或图的高效算法,直接模拟产品的装配过程。通过在装配与或图节点的数据结构中增加零部件的关联信息检查子装配间的关联关系,通过检查装配优先关系避免非法节点的生成,通过限定装配与或图节点的组合范围、分批地生成装配与或图节点以避免装配与或图节点的重复组合,整个装配与或图采用自底向上的方式生成。理论分析和实验比较的结果均表明,本文算法的时间复杂度明显低于现有算法,空间复杂度和现有算法基本相等。     

Design automation and optimization of assembly sequences for complex mechanical systems

Assembly sequence design for a mechanical system can have significant impact on manufacturing cost and product quality. Traditionally, such a design process is largely based on experience and best practices, often ineffective and non-optimal as the system becomes complex. This paper proposes a new, systematic method for automatic assembly sequence design and optimization. Key elements include assembly modeling, sequence planning, locating scheme optimization, dimensional quality evaluation, and optimization. First, a directed graph and an assembly matrix are employed to describe the assembly relation of a system. Then, the feasible assembly sequences are generated through layered subassembly detection of adjacency matrices, filtered by engineering constraints. To evaluate quickly the assembly quality and compare the influences of different locating point schemes, a linear 3D variation propagation analysis model with deterministic locating principle is introduced. The optimal locating scheme is then selected using a genetic algorithm with the least variation propagation. Finally, the assembly dimensional quality for different sequences is evaluated and the optimal assembly sequences are achieved through genetic algorithms. A case of automotive body side assembly is presented to illustrate the whole methodology.     

基于CATIA中DELMIA的虚拟装配技术的应用

以某产品的模具为例,对虚拟装配技术在模具产品上的运用进行了初步的探讨,从虚拟装配的实现流程、产品的层次结构划分、装配顺序规划及路径规划进行了分析,并基于CATIA实现了该产品组件的装配过程仿真,确定了合理的装配顺序和路径,为虚拟装配技术在产品上的深入应用提供了有益的探索。结合装配工艺的特点和要求,提出了基于虚拟装配技术进行装配工艺设计的流程;最后针对装配工艺设计的实现方法和软件系统做了概述。     

面向装配规划的可重构装配模型

为提高复杂产品装配规划的效率,针对当前装配模型不能有效支持结构重构的问题,分析了重构对装配模型中信息变更的影响,提出了一种基于装配关系元的装配关系模型表达方法,实现了装配模型中关系信息和层次信息的柔性关联,进一步给出了可重构装配模型的信息组织方法和存储机制。在引入相关重构算法概念的基础上,给出了装配模型信息动态管理维护算法,以保证装配模型信息在重构前后的完整性与一致性。通过产品实例说明了上述研究成果的可行性和实用性。     

Virtual assembly planning and assembly-oriented quantitative evaluation of product assemblability

Assembly motion navigation and assemblability evaluation play key roles in assembly design, assembly operation analysis, and assembly planning. The accurate positioning of parts and realistic simulation of the assembly process are the premise of the evaluation and optimization of product design. The product assemblability evaluation is needed during the initial design stage in order to identify potential assembly problems. This paper presents a motion navigation method based on force guidance, which achieves a realistic simulation of the assembly process. A novel approach to assemblability and assembly sequence analysis and evaluation is developed. The calculation methods of assembly force, contact force, and assembly torque under the influences of part properties, visual, and human factors etc. are given. Quantitative evaluation of component assemblability (CA) according to the assembly time and assembly trial times is developed. Then, from an overall perspective, a product assemblability (PA) evaluation system is established on the basis of assemblability of each component and the assembly sequence is optimized according to the PA evaluation results. This algorithm has been applied to a self-developed desktop virtual assembly prototype system. An example is illustrated, and the results prove that this algorithm provides a realistic and accurate assembly motion navigation in virtual space and gives a correct and appropriate quantitative evaluation of the product assemblability.     

Subassembly identification for assembly sequence planning

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.     

集成环境下基于割集的装配顺序生成算法研究

在分析总结以往学者对装配顺序规划研究的基础上，综合拆卸法和优先约束法的特点，探讨了一种新的装配顺序分析方法，该方法利用产品的装配域信息，根据图论的割集法对产品进行拆分，建立几何优先约束关系，然后通过人机交互的方式建立工艺优先约束关系，最终得到可行的产品装配顺序。实现了集成环境下基于割集的装配顺序规划。给出了割集的生成算法框图以及装配顺序规划的算法框图，最后通过实例验证。     

基于虚拟技术的装配工艺设计系统研究

介绍了基于虚拟技术的三维计算机辅助装配工艺设计系统,提出了3D-VAPP系统的体系结构;并对CAD模型的数据转换、可视化装配顺序和装配路径规划、装配过程动态模拟验证、装配工艺知识维护、装配工艺文件管理等一系列关键技术及解决方案进行了论述;尤其提出了一种基于多层次面片机械模型的精确碰撞检测算法及装配过程多角度观察镜头自动切换算法流程。最后,给出了系统进一步研究的趋势。     

装配序列生成的有序二叉决策图技术研究

为提高装配序列规划求解效率,在图论割集法的基础上,引入有序二叉决策图描述装配关联图、装配操作、装配几何可行性和装配稳定性.利用装配优先约束关系,简化装配关联图,设计了基于符号有序二叉决策图技术的装配序列生成算法,分析了该算法的时间复杂度.在每一次割集分解之后,检验子装配体的几何可行性和稳定性,实现装配序列生成过程中状态空间的隐式表示和搜索.研究实例验证了基于符号有序二叉决策图技术的装配序列生成算法的可行性和有效性.     

产品装配设计中的生产模式技术与应用

计算机集成制造系统CIMS和并行工程CE技术的发展和应用,对装配设计提出更高的要求.实现产品设计与产品装配规划信息集成是实现产品计算机辅助自动装配的重要基础.在介绍课题研究的背景及意义的基础上,分析国内外装配设计及规划研究中常见的几项装配生产模式技术[1].     

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).     

Integrated assembly and machining planning for electronic products using a genetic algorithm approach

To produce an electronic product, both assembly operations and machining operations are required in the process plan. In most cases, the assembly operations and machining operations need to be combined in a continued order with an integrated sequence. This is different from the traditional process planning approaches in which machining operations and assembly operations are separated as two independent tasks with no interactions. For an electronic product, the two types of operations and the associated costs may affect each other in an interactive way. Therefore, the sequence planning of assembly operations and machining operations must be analyzed with an integrated model. In this research, a graph-based model is presented to represent the assembly and machining operations in an integrated model. The related operation cost functions are developed to evaluate the costs for the integrated assembly and machining sequences. The integrated sequence planning problem is solved using a genetic algorithm approach with an objective of lowest operation costs. As a result, the assembly operations and machining operations can be planned in an integrated sequence suitable for producing electronic products. The result shows that the developed method using the genetic algorithm approach is efficient for solving the integrated sequence planning problem. Example products are demonstrated and discussed.     

A pragmatic system to support interactive assembly planning and training in an immersive virtual environment (I-VAPTS)

Assembly planning for complex products is a difficult task requiring both intensive knowledge and experience. Computer aided assembly planning (CAAP) systems have been the subject of considerable research in recent years without achieving a wide application in manufacturing industry. In this paper an alternative approach to the generation of an optimal assembly planning scheme is presented based on the adoption of immersive virtual reality. A product is assembled from CAD models by providing a CAD interface to transfer assembly constraint information from the CAD system to a virtual environment. In the virtual environment an efficient dynamic recognition and management method based on surface geometry is employed, and a process-oriented assembly task model is established to support interactive assembly planning and evaluation. The system is implemented using an object oriented methodology, and has been successfully applied to train and guide the assembly workers in a pump assembly process.     

An agent-based collaborative assembly process planning system

In recent years, the competition among manufacturers to reduce the development time of new products has been quite fierce. At the same time, customers’ needs have become relatively diverse. Considering these facts, it is essential for manufacturers to build an assembly line in the shortest time possible. Because an assembly line for varied and complex products involves numerous workstations, assembly operations and resources, it is extremely difficult for assembly process planners to develop an efficient assembly sequence and position. Thus, in order to overcome such complications, the best alternative is for a number of process planners to develop a process plan synchronously . This paper introduces a new process planning method for assembly lines based on a collaborative system. In it we propose an agent-based collaborative process planning system, and to verify it, we implement the system in an Internet environment and apply it to some practical case studies.     

Constraint ratio in product assembly planning

Assembly planning considers the product, process, and production system. The existence of constraints makes the assembly planning process difficult and time consuming. The planning degree of freedom (PDOF) for designers will be increased if the number of constraints is decreased on either the product or the other sides. A higher PDOF means that companies can be more flexible in responding rapidly to the assembly of parts. In this paper, a constraint ratio (C_R) has been defined to measure the influence of the product constraints on assembly planning. Some rules have been established to simplify the evaluation procedures of the constraint ratio of the product. Examples are illustrated and explained.     

An effective integration approach toward assembly sequence planning and evaluation

An integration strategy for assembly sequence planning and sequence scheme evaluation is proposed. This strategy can be used to plan a reasonable assembly sequence, to optimize a sequence scheme, and to predict whether a collision will occur between the assembly tool and assembled components by considering factors like target components and assembly resources. A hybrid method is presented for assembly sequence modeling that combines human-computer interactive operations to manually build a hierarchical assembly sequence main model and a hybrid graph method to automatically generate sub-assembly sequence schemes of the main model. An optimization algorithm based on time-cost is introduced to handle a best candidate components selection. This relieves the problem of limited capability found when handling large size assembly models with traditional methods. The essential issues involved in system implementation are discussed as well; these include a representation method for the assembly consequence model, an optimization model of assembly sequence planning, and an object-oriented system architecture model employed with multi-agent technology for visually evaluating the assembling process. This system, KM computer-aided assembly process planning, KMCAAPP, has been developed on the basis of our previous work, KMCAD3; KMCAAPP uses the presented approach. KMCAAPP can be integrated with CAD model from KMCAD3D. A case study shows that the presented approach can use large CAD assembly models and delivers a feasible and effective way to integrate the assembly sequence planning process with scheme evaluation by visually evaluating the assembling process. This allows the identification of design errors in a timely manner and mitigates economic loss.