Assembly Sequence Planning Using Inductive Learning

1999 ◽  
Vol 11 (4) ◽  
pp. 315-320 ◽  
Author(s):  
Takeshi Murayama ◽  
◽  
Bungo Takemura ◽  
Fuminori Oba ◽  
Keyword(s):  
Inductive Learning ◽  
Assembly Sequence Planning ◽  
Assembly Sequence ◽  
Heuristic Rules ◽  
Additional Training ◽  
Sequence Planning ◽  
Sequence Generation ◽  
Assembly Sequences ◽  
Training Examples ◽  
Assembly Sequence Generation

The authors propose acquiring heuristic rules automatically for generating assembly sequences efficiently. Heuristic rules are reduced from training examples by inductive learning. Additional training examples are made from information on assembly sequences and used for modifying heuristic rules. As the assembly sequence generation and modification of heuristic rules are executed more, heuristic rules are refined and assembly sequences are generated efficiently. An experiment demonstrated the effectiveness of the approach.

scholarly journals Automatically generating assembly sequences with an ontology-based approach

2019 ◽  
Vol 40 (2) ◽  
pp. 319-334 ◽  
Author(s):  
Yanru Zhong ◽  
Chaohao Jiang ◽  
Yuchu Qin ◽  
Guoyu Yang ◽  
Meifa Huang ◽  
...  
Keyword(s):  
Design Methodology ◽  
Feasible Solution ◽  
Automatic Generation ◽  
Great Difficulty ◽  
Assembly Sequence Planning ◽  
Assembly Sequence ◽  
Content Type ◽  
Sequence Generation ◽  
Assembly Sequences ◽  
Assembly Sequence Generation

Purpose The purpose of this paper is to present and develop an ontology-based approach for automatic generation of assembly sequences. Design/methodology/approach In this approach, an assembly sequence planning ontology is constructed to represent the structure and interrelationship of product geometry information and assembly process information. In the constructed ontology, certain reasoning rules are defined to describe the knowledge and experience. Based on the ontology with reasoning rules, the algorithm for automatically generating assembly sequences is designed and implemented. Findings The effectiveness of this approach is verified via applying it to generate the assembly sequences of a gear reducer. Originality/value The main contribution of the paper is presenting and developing an ontology-based approach for automatically generating assembly sequences. This approach can provide a feasible solution for the issue that mathematics-based assembly sequence generation approaches have great difficulty in explicitly representing assembly experience and knowledge.

A Particle Swarm Algorithm for Assembly Sequence Planning

2010 ◽  
Vol 97-101 ◽  
pp. 3243-3246
Author(s):  
Yan Feng Xing ◽  
Yan Song Wang ◽  
Xiao Yu Zhao
Keyword(s):  
Particle Swarm ◽  
Tolerance Analysis ◽  
Assembly Sequence Planning ◽  
Particle Swarm Algorithm ◽  
Assembly Sequence ◽  
Sequence Generation ◽  
Assembly Sequences ◽  
Swarm Algorithm ◽  
Assembly Sequence Generation ◽  
Optimal Assembly

A particle swarm algorithm is proposed to generate optimal assembly sequences for compliant assemblies. Firstly, the liaison graph and the adjacency matrix describe the geometry of the compliant assemblies. An assembly sequence is represented by a character string, whose length is the number of all parts. The conceptual tolerance analysis is used to evaluate feasible sequences. Thereafter, the particle swarm algorithm is presented to generate assembly sequences, in which the elite ratio is applied to improve optimization results. Finally a fender assembly is used to illustrate the algorithm of assembly sequence generation and optimization.

Process Knowledge Integrated Assembly Sequence Planning for Control Panel

2020 ◽  
Vol 14 (1) ◽  
pp. 6-17
Author(s):  
Atsuko Enomoto ◽  
Noriaki Yamamoto ◽  
Yoshio Yamamura ◽  
Yoshio Sugawara ◽  
◽  
...  
Keyword(s):  
Assembly Sequence Planning ◽  
Control Panel ◽  
Assembly Process ◽  
Assembly Sequence ◽  
Automated Assembly ◽  
Process Knowledge ◽  
Sequence Planning ◽  
Sequence Generation ◽  
Assembly Sequence Generation

Completely automated assembly sequence planning for control panels is proposed. The proposed algorithm generates the manufacturing bill of material for the assembly processes and total assembly sequence. The algorithm integrates the knowledge of assembly process into a near optimum assembly sequence generation.

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.

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.

Influence of assembly predicate consideration on optimal assembly sequence generation

2015 ◽  
Vol 35 (4) ◽  
pp. 309-316 ◽  
Author(s):  
M. V. A. Raju Bahubalendruni ◽  
Bibhuti Bhusan Biswal ◽  
Manish Kumar ◽  
Radharani Nayak
Keyword(s):  
Low Cost ◽  
Problem Formulation ◽  
Search Space ◽  
Computational Time ◽  
Assembly Sequence ◽  
Content Type ◽  
Sequence Generation ◽  
Assembly Sequences ◽  
Assembly Sequence Generation ◽  
Optimal Assembly

Purpose – The purpose of this paper is to find out the significant influence of assembly predicate consideration on optimal assembly sequence generation (ASG) in terms of search space, computational time and possibility of resulting practically not feasible assembly sequences. An appropriate assembly sequence results in minimal lead time and low cost of assembly. ASG is a complex combinatorial optimisation problem which deals with several assembly predicates to result an optimal assembly sequence. The consideration of each assembly predicate highly influences the search space and thereby computational time to achieve valid assembly sequence. Often, the ignoring an assembly predicate leads to inappropriate assembly sequence, which may not be physically possible, sometimes predicate assumption drastic ally raises the search space with high computational time. Design/methodology/approach – The influence of assuming and considering different assembly predicates on optimal assembly sequence generation have been clearly illustrated with examples using part concatenation method. Findings – The presence of physical attachments and type of assembly liaisons decide the consideration of assembly predicate to reduce the complexity of the problem formulation and overall computational time. Originality/value – Most of the times, assembly predicates are ignored to reduce the computational time without considering their impact on the assembly sequence problem irrespective of assembly attributes. The current research proposes direction towards predicate considerations based on the assembly configurations for effective and efficient ASG.

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.

An intelligent approach towards optimal assembly sequence generation

2016 ◽  
Vol 232 (4) ◽  
pp. 531-541 ◽  
Author(s):  
MVA Raju Bahubalendruni ◽  
Bibhuti Bhusan Biswal
Keyword(s):  
Objective Function ◽  
Efficient Method ◽  
Assembly Sequence ◽  
Sequence Generation ◽  
Computational Performance ◽  
Assembly Sequences ◽  
Working Principle ◽  
Assembly Sequence Generation ◽  
Intelligent Approach ◽  
Optimal Assembly

In this paper, a novel and efficient method is developed and proposed to obtain all valid assembly sequences and optimized assembly sequence for a given assembled product. The working principle of methodology is clearly illustrated with different example products. Four basic predicates namely “liaison predicate, geometrical feasibility, mechanical feasibility, and stability” are considered to validate each sequence. The proposed method is effective and proven efficient in the resulting all set of feasible assembly sequences described. Tool/gripper changes, assembly orientation changes, and part trajectory distances are considered to state the optimality of a valid assembly sequence. Achieving optimized assembly sequence through the proposed method for user-defined objective function is briefly illustrated. The computational performance of the method in achieving all valid assembly sequences is illustrated for various dissimilar products.

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.

scholarly journals A review on assembly sequence generation and its automation

2015 ◽  
Vol 230 (5) ◽  
pp. 824-838 ◽  
Author(s):  
MVA Raju Bahubalendruni ◽  
Bibhuti Bhusan Biswal
Keyword(s):  
Computer Aided Design ◽  
Manufacturing Industry ◽  
Cost Effective ◽  
Assembly Sequence ◽  
Mechanical Assembly ◽  
Design Environment ◽  
Sequence Generation ◽  
Assembly Sequences ◽  
Soft Computing Techniques ◽  
Assembly Sequence Generation

Sequence of feasible mechanical assembly operations plays significant role in overall cost optimisation process for manufacturing industry and thus great importance is given to assembly sequence generation from past four decades. Though achieving at least one feasible sequence is focused in the earlier stages of research, the introduction of soft computing techniques attracted the industrial engineers towards cost-effective, optimised assembly sequences to attain economical manufacturing process. The integration of assembly sequence generation methods with computer aided design environment ensures more correctness and flexibility to automate the process. In this paper, a detailed review on various methods, their applications and limitations is presented and well discussed.

Sign in / Sign up

Export Citation Format

Share Document