Evaluation of product assemblability in different assembly sequences

2011 ◽  
pp. 65-105
Author(s):  
Cong Lu ◽  
Jerry Ying Hsi Fuh ◽  
Yoke San Wong
Keyword(s):  
Assembly Sequences

Structural Analysis of Product and Computer-Aided Assembly Planning in AssemBL Software Package

2018 ◽  
pp. 11-33
Author(s):  
A. N. Bozhko
Keyword(s):  
Computer Aided Design ◽  
State Of The Art ◽  
Graph Model ◽  
Design System ◽  
Assembly Planning ◽  
Complex Products ◽  
Assembly Sequences ◽  
Computer Aided ◽  
Cad Cam ◽  
Aided Design

Computer-aided design of assembly processes (Computer aided assembly planning, CAAP) of complex products is an important and urgent problem of state-of-the-art information technologies. Intensive research on CAAP has been underway since the 1980s. Meanwhile, specialized design systems were created to provide synthesis of assembly plans and product decompositions into assembly units. Such systems as ASPE, RAPID, XAP / 1, FLAPS, Archimedes, PRELEIDES, HAP, etc. can be given, as an example. These experimental developments did not get widespread use in industry, since they are based on the models of products with limited adequacy and require an expert’s active involvement in preparing initial information. The design tools for the state-of-the-art full-featured CAD/CAM systems (Siemens NX, Dassault CATIA and PTC Creo Elements / Pro), which are designed to provide CAAP, mainly take into account the geometric constraints that the design imposes on design solutions. These systems often synthesize technologically incorrect assembly sequences in which known technological heuristics are violated, for example orderliness in accuracy, consistency with the system of dimension chains, etc.An AssemBL software application package has been developed for a structured analysis of products and a synthesis of assembly plans and decompositions. The AssemBL uses a hyper-graph model of a product that correctly describes coherent and sequential assembly operations and processes. In terms of the hyper-graph model, an assembly operation is described as shrinkage of edge, an assembly plan is a sequence of shrinkages that converts a hyper-graph into the point, and a decomposition of product into assembly units is a hyper-graph partition into sub-graphs.The AssemBL solves the problem of minimizing the number of direct checks for geometric solvability when assembling complex products. This task is posed as a plus-sum two-person game of bicoloured brushing of an ordered set. In the paradigm of this model, the brushing operation is to check a certain structured fragment for solvability by collision detection methods. A rational brushing strategy minimizes the number of such checks.The package is integrated into the Siemens NX 10.0 computer-aided design system. This solution allowed us to combine specialized AssemBL tools with a developed toolkit of one of the most powerful and popular integrated CAD/CAM /CAE systems.

A Novel Symbolic OBDD Algorithm for Generating Mechanical Assembly Sequences Using Decomposition Approach

2011 ◽  
Vol 201-203 ◽  
pp. 24-29
Author(s):  
Zhou Bo Xu ◽  
Tian Long Gu ◽  
Liang Chang ◽  
Feng Ying Li
Keyword(s):  
Assembly Sequence Planning ◽  
The Novel ◽  
Mechanical Assembly ◽  
Breadth First Search ◽  
Decomposition Approach ◽  
Translation Function ◽  
Assembly Sequences ◽  
Cut Set ◽  
Connected Subgraphs ◽  
Induced Graph

The compact storage and efficient evaluation of feasible assembly sequences is one crucial concern for assembly sequence planning. The implicitly symbolic ordered binary decision diagram (OBDD) representation and manipulation technique has been a promising way. In this paper, Sharafat’s recursive contraction algorithm and cut-set decomposition method are symbolically implemented, and a novel symbolic algorithm for generating mechanical assembly sequences is presented using OBDD formulations of liaison graph and translation function. The algorithm has the following main procedures: choosing any one of vertices in the liaison graph G as seed vertex and scanning all connected subgraphs containing seed vertex by breadth first search; transforming the problem of enumerating all cut-sets in liaison graph into the problem of generating all the partitions: two subsets V1and V2of a set of vertices V where both the induced graph of vertices V1and V2are connected; checking the geometrical feasibility for each cut-set. Some applicable experiments show that the novel algorithm can generate feasible assembly sequences correctly and completely.

Tool workspace consideration for assembly plan generation

2021 ◽  
Vol 41 (5) ◽  
pp. 612-625
Author(s):  
Akram Bedeoui ◽  
Riadh Ben Hadj ◽  
Moncef Hammadi ◽  
Nizar Aifaoui
Keyword(s):  
Collision Detection ◽  
New Product ◽  
Production Costs ◽  
Assembly Sequence ◽  
Content Type ◽  
Plan Generation ◽  
Assembly Sequences ◽  
Dynamic Interference ◽  
Time Decrease

Purpose During the design of a new product, the generation of assembly sequences plans (ASPs) has become one of the most important problems taken into account by researchers. In fact, a good mounting order allows the time decrease of the assembly process which leads to the reduction of production costs. In this context, researchers developed several methods to generate and optimize ASP based on various criteria. Although this paper aims to improve the quality of ASP it is necessary to increase the number of criteria which must be taken into account when generating ASPs. Design/methodology/approach In this paper, an ASP generation approach, which is based on three main algorithms, is proposed. The first one generates a set of assembly sequences based on stability criteria. The obtained results are treated by the second algorithm which is based on assembly tools (ATs) workspace criterion. An illustrative example is used to explain the different steps of this proposed approach. Moreover, a comparative study is done to highlight its advantages. Findings The proposed algorithm verifies, for each assembly sequence, the minimal required workspace of used AT and eliminates the ASPs non-respecting this criterion. Finally, the remaining assembly sequences are treated by the third algorithm to reduce the AT change during the mounting operation. Originality/value The proposed approach introduces the concept of AT workspace to simulate and select ASPs that respect this criterion. The dynamic interference process allows the eventual collision detection between tool and component and avoids it. The proposed approach reduces the AT change during the mounting operations.

Filippova Automated planning of graduality assembly

2021 ◽  
pp. 28-44
Author(s):  
D. Proskurenko ◽  
◽  
O. Tretyak ◽  
M. Demchenko ◽  
M. Filippova ◽  
...  
Keyword(s):  
Computational Effort ◽  
Planning System ◽  
Assembly Planning ◽  
Component Part ◽  
Practical Implementation ◽  
Early Stages ◽  
Assembly Sequences ◽  
Assembly Operations ◽  
Communication Schedule ◽  
Relation Graph

Modern industrial production requires the improvement of assembly processes, and thus increase the level of automated intelligent sequence planning. Therefore, researches in the field of automation of the sequence of assembly of products in industries are relevant at this time. In today's world there is a need to develop complex, accurate products. Problems are created in industries due to the reduction of the life cycle of products. There is a need to study the problem of assembly planning to achieve the goal of practical implementation and standardization of assembly plans. Creating graphs of the addition process is one of the problems. The assembly planning system can reduce human intervention in the process and reduce computational effort. The finished assembly contains many components that can be assembled using many sequences. A review of the methods from the literature showed that although these methods increase the automation level, they still cannot be applied to actual production because they do not take into account the experience and knowledge that can play a major role in planning and are of great value. Assembly planning, relationship charts, priority charts. Improving the assembly planning system to create a communication schedule and an assembly priority schedule was proposed. The advanced system will be used to generate possible assembly sequences with subassembly identification. A system has been developed to create alternative possible assembly sequences that can be used by component part / product designers in the early stages. A system capable of generating assembly sequences for simultaneous assembly of multiple parts has been proposed. Conclusions and work results can be applied used and improved for more productive product development by designers in the early stages and faster assembly of products in enterprises. The paper did not consider practical limitations (gravity) and irreversible assembly operations, such as permanent fastening, welding etc. Кey words: assembly, blocking graph, relation graph, sequence

scholarly journals Assembly Sequence Planning Using Artificial Neural Networks for Mechanical Parts Based on Selected Criteria

2021 ◽  
Vol 11 (21) ◽  
pp. 10414
Author(s):  
Marcin Suszyński ◽  
Katarzyna Peta
Keyword(s):  
Neural Networks ◽  
Artificial Neural Networks ◽  
Clustering Algorithm ◽  
Assembly Sequence Planning ◽  
Planning System ◽  
Assembly Sequence ◽  
Mechanical Parts ◽  
Sequence Planning ◽  
Assembly Sequences ◽  
Artificial Neural

The proposed model of the neural network describes the task of planning the assembly sequence on the basis of predicting the optimal assembly time of mechanical parts. In the proposed neural approach, the k-means clustering algorithm is used. In order to find the most effective network, 10,000 network models were made using various training methods, including the steepest descent method, the conjugate gradients method, and Broyden–Fletcher–Goldfarb–Shanno algorithm. Changes to network parameters also included the following activation functions: linear, logistic, tanh, exponential, and sine. The simulation results suggest that the neural predictor would be used as a predictor for the assembly sequence planning system. This paper discusses a new modeling scheme known as artificial neural networks, taking into account selected criteria for the evaluation of assembly sequences based on data that can be automatically downloaded from CAx systems.

A Dynamic Assembly Modeling Method for Satellite Final Assembly Sequence Planning

2010 ◽  
Vol 156-157 ◽  
pp. 332-338
Author(s):  
Yuan Zhang ◽  
Kai Fu Zhang ◽  
Jian Feng Yu ◽  
Lei Zhao
Keyword(s):  
Dynamic Model ◽  
Static Model ◽  
Modeling Method ◽  
Assembly Sequence Planning ◽  
Assembly Model ◽  
Assembly Sequence ◽  
Final Assembly ◽  
Model Tree ◽  
Assembly Sequences ◽  
Dynamic Assembly

To study the effect of assembly process information combining disassemble and assemble on satellite assembly sequence, this paper presents an object-oriented and assembly information integrated model, which is composed of static model and dynamic model. The feasibility determination based on Cut-set theory is presented and the construction algorithm of dynamic model is established by static model, the dynamic assembly model tree is obtained by analyzing in layers and verifying possible states using this algorithm, where the assembly model tree includes all the geometric feasible assembly sequences of satellite. Finally, this modeling method is verified by a satellite product.

Sign in / Sign up

Export Citation Format

Share Document