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.

Assembly Sequence Planning by Using Multiple Random Trees Based Motion Planning

2012 ◽  
Author(s):  
Carlos Morato ◽  
Krishnanand Kaipa ◽  
Satyandra K. Gupta
Keyword(s):  
Motion Planning ◽  
Assembly Sequence Planning ◽  
Random Trees ◽  
Planning System ◽  
Assembly Model ◽  
Assembly Sequence ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Disassembly Sequence ◽  
Assembly Sequences

In this paper, we introduce multiple random trees based motion planning to perform assembly sequence planning for complex assemblies. Initially, given an assembly model, our technique performs disassembly sequence planning. This approach dynamically reduces the size and complexity of the assembly based on a hierarchical exploration structure that keeps information about the completion of the disassembly. Next, the disassembly information is used to generate feasible assembly sequences, along with precedence constraints, to assemble each part into the current subassembly. The motion planning system chooses part order by detecting geometrical interferences and analyzing feasible part movements. Results from tests on a variety of complex assemblies validate the efficiency of our approach.

Research on Aircraft Assembly Sequence Planning Technology Based on Key Characteristics

2013 ◽  
Vol 328 ◽  
pp. 9-16 ◽  
Author(s):  
Zhan Lei Sun ◽  
Peng Fei Han ◽  
Gang Zhao
Keyword(s):  
Process Design ◽  
Assembly Sequence Planning ◽  
Assembly Process ◽  
Assembly Sequence ◽  
Assembly Quality ◽  
Constraint Matrix ◽  
Aircraft Assembly ◽  
Sequence Planning ◽  
Key Characteristics ◽  
Assembly Sequences

Assembly Sequence Planning (ASP) is an essential question for aircraft assembly process design. Modern aircraft assembly contains plenty of complex shape components, which have so many assembly features to ensure, this leads to a large number of feasible assembly sequences using traditional sequence planning algorithms; and it is hard to evaluate the contribution to assembly quality for every sequence. A methodology called Key Characteristics Based ASP is proposed in this paper, which can significantly reduce unavailable sequences and ensure key features for quality in assembly process designing compared with previous methods. The methodology focuses on the final assembly quality and considers it as Assembly Key Characteristics (AKCs) in the beginning of assembly process design. With tools such as AKCs decomposition, Datum Flow Chain, precedence constraint matrix, the methodology describes the main process for ASP. To verify the technologys effectiveness, this paper presents an application of the algorithm in an aircraft component assembly by an 863 program.

AUTOMATIC COLLISION DETECTION FOR ASSEMBLY SEQUENCE PLANNING USING A THREE-DIMENSIONAL SOLID MODEL

2011 ◽  
Vol 10 (02) ◽  
pp. 277-291 ◽  
Author(s):  
ALFADHLANI ◽  
T. M. A. ARI SAMADHI ◽  
ANAS MA'RUF ◽  
ISA SETIASYAH TOHA
Keyword(s):  
Free Path ◽  
Collision Detection ◽  
Three Dimensional ◽  
Assembly Sequence Planning ◽  
Detection Methods ◽  
Assembly Sequence ◽  
Sequence Planning ◽  
Assembly Sequences ◽  
Geometrical Data ◽  
Selection Of

Assembly sequence planning of a product involves several steps, including generation of precedence constraints, generation of assembly sequences, and selection of assembly sequences. Generation and selection of assembly sequences should be able to guarantee the feasibility of assembly. Assembly will be feasible if there is no collision between components when assembled. Detection of collision-free path of assembly can be done in an automated way. There are a number of collision detection methods that have been developed, but the method requires a complicated process of data geometry analysis. This paper proposes a method for detecting a collision-free path of the assembly component in a more simple way. Geometrical data required, taken from the three-dimensional (3D) solid drawing in the form of stacked drawing in computer-aided design (CAD) systems. Retrieval of geometrical data of components and detection of the collision-free path of an assembly were done in an automated way, directly from the CAD system.

A Symbolic OBDD-Based Algorithm for Assembly Sequence Planning

2010 ◽  
Vol 97-101 ◽  
pp. 2444-2448
Author(s):  
Feng Ying Li ◽  
Tian Long Gu ◽  
Liang Chang
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Assembly Sequence Planning ◽  
Decision Diagrams ◽  
Assembly Sequence ◽  
Binary Decision ◽  
Sequence Planning ◽  
Assembly Sequences ◽  
Planning Algorithm ◽  
The One

Algorithms based on timed Petri net are competitive for solving the problem of assembly sequence planning (ASP). In order to alleviate the state-space explosion problem which is caused by the Petri net-based representation of assembly sequences and to improve the efficiency of planning algorithms, an approach based on ordinary binary decision diagrams (OBDDs) is presented in this paper. On the one hand, all the timed transitions in Petri nets are substituted by some technically designed timed transition structures; on the other hand, Petri nets used in algorithms of assembly sequence planning are represented symbolically as OBDDs. As a result, a novel assembly sequence planning algorithm based on symbolic OBDDs is presented. With the help of OBDDs, both the marking vectors and the states of Petri nets are formulated more compactly; at the same time, the searching processes can be manipulated implicitly. Therefore, compared with original algorithms, both the time performance and the space performance are improved.

Automatic feature recognition using artificial neural networks to integrate design and manufacturing: Review of automatic feature recognition systems

2010 ◽  
Vol 25 (3) ◽  
pp. 289-304 ◽  
Author(s):  
Bojan R. Babić ◽  
Nenad Nešić ◽  
Zoran Miljković
Keyword(s):  
Neural Networks ◽  
Artificial Neural Networks ◽  
Feature Recognition ◽  
System Development ◽  
Planning System ◽  
Computer Aided Process Planning ◽  
Design And Manufacturing ◽  
Automatic Feature Recognition ◽  
Feature Technology ◽  
Artificial Neural

AbstractFeature technology is considered an essential tool for integrating design and manufacturing. Automatic feature recognition (AFR) has provided the greatest contribution to fully automated computer-aided process planning system development. The objective of this paper is to review approaches based on application of artificial neural networks for solving major AFR problems. The analysis presented in this paper shows which approaches are suitable for different individual applications and how far away we are from the formation of a general AFR algorithm.

scholarly journals Assembly Sequence Planning by Probabilistic Tree Transformation

2018 ◽  
Vol 6 (2) ◽  
pp. 354-368
Author(s):  
Takeshi Murayama ◽  
Yuichi Mine ◽  
Hiroshi Fujinaka ◽  
Toru Eguchi
Keyword(s):  
Software Tool ◽  
Assembly Sequence Planning ◽  
Assembly Sequence ◽  
Sequence Planning ◽  
Cad System ◽  
Assembly Sequences ◽  
Long Time ◽  
Cad Cam ◽  
Machine Industry ◽  
Tree Transformation

Various types of computer systems including CAD/CAM systems have been introduced in machine industry. Some of the systems can handle assembly sequence planning, however it requires long time for planning. This paper proposes a method of generating assembly sequences efficiently. This method extracts some parts and/or subassemblies whose possibilities of being removed from a product are strong, and tests whether they can be removed without any geometric interference. By performing these operations repeatedly, the method generates a disassembly sequence of the product, and obtains an assembly sequence by reversing it. The extraction of some parts and/or subassemblies is performed, based on probabilistic tree transformation. The authors present a calculation example by using a software tool integrated with a CAD system.

scholarly journals Optimum Assembly Sequence Planning System Using Discrete Artificial Bee Colony Algorithm

2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Özkan Özmen ◽  
Turgay Batbat ◽  
Tolgan Özen ◽  
Cem Sinanoğlu ◽  
Ayşegül Güven
Keyword(s):  
Computer Aided Design ◽  
Artificial Bee Colony ◽  
Three Dimensional ◽  
Assembly Sequence Planning ◽  
Planning System ◽  
Assembly Planning ◽  
Assembly Sequence ◽  
Bee Colony ◽  
Assembly Sequences ◽  
The Matrix

Assembly refers both to the process of combining parts to create a structure and to the product resulting therefrom. The complexity of this process increases with the number of pieces in the assembly. This paper presents the assembly planning system design (APSD) program, a computer program developed based on a matrix-based approach and the discrete artificial bee colony (DABC) algorithm, which determines the optimum assembly sequence among numerous feasible assembly sequences (FAS). Specifically, the assembly sequences of three-dimensional (3D) parts prepared in the computer-aided design (CAD) software AutoCAD are first coded using the matrix-based methodology and the resulting FAS are assessed and the optimum assembly sequence is selected according to the assembly time optimisation criterion using DABC. The results of comparison of the performance of the proposed method with other methods proposed in the literature verify its superiority in finding the sequence with the lowest overall time. Further, examination of the results of application of APSD to assemblies consisting of parts in different numbers and shapes shows that it can select the optimum sequence from among hundreds of FAS.

Sign in / Sign up

Export Citation Format

Share Document