Assembly sequences: planning and simulating assembly operations

2006 ◽  
Author(s):  
V. Chaudron ◽  
P. Martin ◽  
X. Godot
Keyword(s):  
Assembly Sequences ◽  
Assembly Operations ◽  
Assembly Sequences Planning

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

Petri Net Models for Assembly Sequences Planning

2007 ◽  
Vol 10-12 ◽  
pp. 411-415 ◽  
Author(s):  
Y.L. Fu ◽  
R. Li ◽  
H.B. Feng ◽  
Y.L. Ma
Keyword(s):  
Petri Net ◽  
Assembly Sequence Planning ◽  
Assembly Model ◽  
Assembly Sequence ◽  
Assembly Operation ◽  
Knowledge Based ◽  
Assembly Sequences ◽  
Model Size ◽  
Assembly Sequences Planning ◽  
Optimal Assembly

Assembly sequences can be represented by a Petri net(PN) which characterizes dynamic system changes and provides a tool for obtaining optimal assembly sequences. In this study some assembly operation constraints are considered in order to obtain more practical sequences which are conformed to real situations. In order to enhancing the efficiency of the assembly sequence planning, knowledge-based Petri net, combining an usual Petri net with expert’s knowledge and experiences, is proposed to construct the assembly model. With the complexity of the product, the product’s assembly model size will be too large to analysis. So the basic subnets are used to reduce the large PN. And the reduced version can be used for the analysis of the original PN. To verify the validity and efficiency of the approach, a variety of assemblies including some complicated products from industry are tested, and the corresponding results are also presented.

Discrete electromagnetism-like mechanism algorithm for assembly sequences planning

2014 ◽  
Vol 52 (12) ◽  
pp. 3485-3503 ◽  
Author(s):  
Liang Gao ◽  
Chunjiang Zhang ◽  
Xinyu Li ◽  
Lijian Wang
Keyword(s):  
Assembly Sequences ◽  
Assembly Sequences Planning

Genetic Algorithm for Assembly Sequences Planning Based on Heuristic Assembly Knowledge

2010 ◽  
Vol 44-47 ◽  
pp. 3657-3661 ◽  
Author(s):  
Hao Pan ◽  
Wen Jun Hou ◽  
Tie Meng Li
Keyword(s):  
Genetic Algorithm ◽  
Fitness Function ◽  
Graph Model ◽  
Initial Population ◽  
New Approach ◽  
Assembly Sequences ◽  
Connection Graph ◽  
Assembly Sequences Planning

To improve the efficiency of Assembly Sequences Planning (ASP), a new approach based on heuristic assembly knowledge and genetic algorithm was proposed. First, Connection Graph of Assembly (CGA) was introduced, and then, assembly knowledge was described in the form of Assembly Rings, on that basis, the assembly connection graph model containing Assembly Rings was defined, and the formation of initial population algorithm was given. In addition, a function was designed to measure the feasible assembly and then the genetic algorithm fitness function was given. Finally, an example was shown to illustrate the effectiveness of the algorithm.

Generation of Optimized Robotic Assembly Sequence Using Immune Based Technique

2012 ◽  
Author(s):  
Bibhuti Bhusan Biswal ◽  
Sujit Kumar Pattanayak ◽  
Rabindra Narayan Mohapatra ◽  
Pramod Kumar Parida ◽  
Panchanand Jha
Keyword(s):  
Cost Effective ◽  
Robotic Assembly ◽  
Assembly Sequence ◽  
Artificial Immune ◽  
Optimal Sequence ◽  
Assembly Sequences ◽  
Assembly Operations ◽  
Assembly Constraints ◽  
Alternative Solutions ◽  
Economical Process

Automated assembly using robots is being gainfully used to enhance the process capabilities in the manufacturing world because of the fact that it is faster, more efficient, precise and cost effective process than any conventional mechanized process. However in assembly operations it is essential to determine the assembly sequence that is feasible, stable and faster so that an economical process can be evolved. Since robotic system is a cost intensive one it is necessary to find out the correct and optimal sequence with the constraints of the process in mind while dealing with assembled products with large number of parts. One of the most critical situations is to detect the best assembly sequence for products having large number of different alternative solutions. In this paper, a new methodology has been developed to find out the best robotic assembly sequence among the feasible robotic sequences. The feasible robotic assembly sequences have been generated based on the assembly constraints and later, the Artificial Immune System (AIS) has been implemented to find out the best assembly sequence.

Evaluation and Search of Assembly Sequences in Large Systems

2013 ◽  
Author(s):  
Ata A. Eftekharian ◽  
Ranjith Poladi ◽  
Matthew I. Campbell
Keyword(s):  
Search Method ◽  
Assembly Planning ◽  
Assembly Model ◽  
Optimal Plan ◽  
Evaluation Approach ◽  
Novel Approach ◽  
Assembly Sequences ◽  
Large Systems ◽  
Assembly Operations

In order to build a comprehensive automated assembly planning tool, three important tasks must be accomplished: generating feasible assembly sequences, evaluating the quality of a sequence, and the search method for finding the optimal plan. This paper describes a novel approach to the latter two. The evaluation approach combines empirical data and geometric reasoning techniques to arrive at estimates of assembly time for any generic assembly model. The evaluation is constantly invoked from a tree-search method that only searches amongst valid assembly operations. The algorithm has been tested on a variety of examples ranging from simple to complex assemblies.

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.

Sign in / Sign up

Export Citation Format

Share Document