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.

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.

Optimizing assembly sequence planning using precedence graph-based assembly subsets prediction method

2019 ◽  
Vol 40 (2) ◽  
pp. 361-375 ◽  
Author(s):  
Nan Zhang ◽  
Zhenyu Liu ◽  
Chan Qiu ◽  
Weifei Hu ◽  
Jianrong Tan
Keyword(s):  
High Efficiency ◽  
Prediction Method ◽  
Solution Space ◽  
Assembly Sequence Planning ◽  
Selection Strategy ◽  
Assembly Process ◽  
Assembly Sequence ◽  
Content Type ◽  
Sequence Planning ◽  
Precedence Graph

Purpose Assembly sequence planning (ASP) plays a vital role in assembly process because it directly influences the feasibility, cost and time of the assembly process. The purpose of this study is to solve ASP problem more efficiently than current algorithms. Design/methodology/approach A novel assembly subsets prediction method based on precedence graph is proposed to solve the ASP problem. The proposed method adopts the idea of local to whole and integrates a simplified firework algorithm. First, assembly subsets are generated as initial fireworks. Then, each firework explodes to several sparks with higher-level assembly subsets and new fireworks are selected for next generation according to selection strategy. Finally, iterating the algorithm until complete and feasible solutions are generated. Findings The proposed method performs better in comparison with state-of-the-art algorithms because of the balance of exploration (fireworks) and exploitation (sparks). The size of initial fireworks population determines the diversity of the solution, so assembly subsets prediction method based on precedence graph (ASPM-PG) can explore the solution space. The size of sparks controls the exploitation ability of ASPM-PG; with more sparks, the direction of a specific firework can be adequately exploited. Practical implications The proposed method is with simple structure and high efficiency. It is anticipated that using the proposed method can effectively improve the efficiency of ASP and reduce computing cost for industrial applications. Originality/value The proposed method finds the optimal sequence in the construction process of assembly sequence rather than adjusting order of a complete assembly sequence in traditional methods. Moreover, a simplified firework algorithm with new operators is introduced. Two basic size parameters are also analyzed to explain the proposed method.

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.

The Two Phased Method of Hull Block Assembly Sequence Planning

2011 ◽  
Vol 421 ◽  
pp. 235-239
Author(s):  
Shi Peng Qu ◽  
Zu Hua Jiang
Keyword(s):  
Constraint Satisfaction ◽  
Constraint Satisfaction Problem ◽  
Assembly Sequence Planning ◽  
Assembly Process ◽  
Assembly Model ◽  
Assembly Sequence ◽  
Hierarchical Assembly ◽  
Sequence Planning ◽  
Whole Process ◽  
Block Based

A hull block assembly sequence planning (ASP) problem is modeled as a constraint satisfaction problem where the precedence relations between operations are considered constraints. In order to generate the proper assembly sequence of the hull block, we analyzed the structure features of the block and built the hierarchical assembly model of the block. Based on this model, we divided the whole process of the block assembly into the small subassembly phase and the unit subassembly phase. There exists the rule that the assembly process of the subassembly in the same phase is similar, and it's different to the subassembly in the different phases. So, we proposed the different methods to plan the assembly sequence of the different phases. An example is given to illustrate that this two phased method can solves the block ASP problem effectively and accurately.

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.

Process Operators and Their Roles in Integrated Assembly Process Planning

1998 ◽  
Author(s):  
Zhi-Kui Ling ◽  
XiangYu Zhou ◽  
Chuck Mclean
Keyword(s):  
Process Planning ◽  
Physical Simulation ◽  
Resource Planning ◽  
Assembly Sequence Planning ◽  
Assembly Process ◽  
Assembly Sequence ◽  
Assembly Process Planning ◽  
Sequence Planning ◽  
Assembly Design ◽  
Assembly Simulation

Abstract An environment to facilitate assembly process planning is proposed in this study. It includes a design support system with two agents supporting the assembly process. One is assembly design agent, and the other is a geometric design agent. The assembly design agent consists of three modules: the assembly sequence planning module, the assembly resource planning module, and the assembly simulation module. The assembly sequence-planning module takes the design information and generates an assembly sequence. This sequence is structured in a tree form, called the Constructive Assembly Tree (CAT). The leaf nodes of the tree correspond to the components of the product. The intermediate nodes are the assembly process operators, each of which characterizes a particular assembly operation, and their associated subassemblies. The resource module assigns the necessary tools, fixtures, supply bins and other resources to each of the process operators. The assembly simulation module traverses a CAT, extracts the necessary assembly information, and drives external physical simulation/animation system to perform virtual assembly simulation/animation process.

scholarly journals Computer Aided Assembly Sequence Generation

2015 ◽  
Vol 6 (3) ◽  
pp. 83-87 ◽  
Author(s):  
Marcin Suszyński ◽  
Jan Żurek
Keyword(s):  
Computer Program ◽  
Directed Graphs ◽  
Assembly Process ◽  
Ball Joint ◽  
Assembly Sequence ◽  
Sequence Generation ◽  
Computer Aided ◽  
Research Findings ◽  
Assembly Sequence Generation

Abstract The purpose of the paper is to explore the problem of modeling technological assembly process, particularly generating assembly sequence for parts and machinery sets. A new computer program Msassembly is introduced. The program was invented by the authors on the basis of an algorithm for determining assembly sequence for parts and machinery sets. The algorithm is based on hypergraphs and directed graphs, as well as on assessment of transitions between assembly states. The principles of operation of Msassembly are presented on the example of modelling the assembly sequence of a ball joint. At the end of the paper, research findings are submitted.

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.

Assembly Sequence Planning for Aircraft Component Based on Improved Clashes Matrix

2011 ◽  
Vol 88-89 ◽  
pp. 22-28 ◽  
Author(s):  
Liu Ying Yang ◽  
Gang Zhao ◽  
Bin Bin Wu ◽  
Guang Rong Yan
Keyword(s):  
Genetic Algorithms ◽  
Objective Function ◽  
Evaluation Criteria ◽  
Assembly Sequence Planning ◽  
Assembly Process ◽  
Assembly Sequence ◽  
Sequence Planning ◽  
Aircraft Cabin ◽  
Aircraft Component ◽  
Interference Matrix

The aircraft parts contain the information of a great number of curves and surfaces, which makes it a big challenge for the aircraft components’ Assembly Sequence Planning (ASP) processes. The traditional interference matrix has limitation of expressing the assembly direction and can easily lead to the failure of ASP optimization. Hence, an improved interference matrix is provided in this paper to deal with the aircraft ASP problem based on the Genetic Algorithms (GA). With the mainly consideration of assembly time according to the assembly sequence evaluation criteria, the objective function is established and evaluated. This paper presents an application of the method in the aircraft cabin door assembly process supported by an 863 program. Meanwhile, the verification of the approach is shown in the practical example on MATLAB platform.

Representation, Generation, and Analysis of Mechanical Assembly Sequences With k-ary Operations

2011 ◽  
Vol 12 (1) ◽  
Author(s):  
Haixia Wang ◽  
Dariusz Ceglarek
Keyword(s):  
Assembly Line ◽  
Assembly Process ◽  
Assembly Sequence ◽  
Mechanical Assembly ◽  
Mixed Graph ◽  
Sequence Generation ◽  
Line Configuration ◽  
Assembly Sequences ◽  
Art Research ◽  
Assembly Sequence Generation

A new methodology is presented to generate all of the assembly sequences for a production system configured as a N-station assembly line with kn (n  = 1, 2,…, N) parts or subassemblies to be assembled at stations 1, 2,…, N, respectively. This expands current approaches in sequence generation applicable for binary assembly process to a k-ary assembly process by including: (i) nonbinary state between two parts, i.e., multiple joints between two parts or subassemblies, is taken into consideration, and (ii) simultaneous assembly of Y (Y≥3) parts or subassemblies. The methodology is based upon proposed k-piece graph and k-piece mixed graph approaches for the assemblies without and with assembly precedence relationship, respectively. Compared with the currently used liaisons graph (or datum flow chain) representation which shows part-to-part assembly relations, the k-piece graph (or k-piece mixed graph) shows all of the feasible subassemblies and their constituent parts and joints (pairs of mating features). Based upon the k-piece graph or k-piece mixed-graph approach, all of the feasible subassemblies for a predetermined assembly line configuration are identified, and all of the sequences for a k-ary assembly process are generated. Case studies are presented to illustrate the advantages of the presented methodology over the state-of-the-art research in assembly sequence generation.

Sign in / Sign up

Export Citation Format

Share Document