Assembly Modeling for 3D Component Based on Polychromatic Sets

2011 ◽  
Vol 411 ◽  
pp. 388-392 ◽  
Author(s):  
Yun Long Li ◽  
Jian Min Gao ◽  
Lei Shi ◽  
Song Wang
Keyword(s):  
Information Matrix ◽  
Spatial Location ◽  
Assembly Sequence Planning ◽  
Assembly Model ◽  
Assembly Sequence ◽  
Assembly Modeling ◽  
Sequence Planning ◽  
Location Modeling ◽  
Dynamic Interference

In order to improve the efficiency of assembly modeling and provide a complete assembly model for assembly sequence planning (ASP), a method of assembly modeling based on polychromatic sets (PS) is proposed. Firstly, the assembly information of 3D Component is obtained by API function in SolidWorks. In addition, assembly incident matrix, information matrix and mapping matrix are built. On the basis of these matrixes, a method of location modeling is explored. The interference relation matrix is developed by judging the spatial location and analyzing dynamic interference relation among parts. Finally, a case study is given to verify the method.

Applications of Mating Conditions in Assembly Sequence Planning Task

1998 ◽  
Author(s):  
Pongsak Dulyapraphant ◽  
Tulga Ozsoy
Keyword(s):  
Degrees Of Freedom ◽  
Tolerance Analysis ◽  
Assembly Sequence Planning ◽  
Assembly Model ◽  
Assembly Sequence ◽  
Kinematics Analysis ◽  
Sequence Planning ◽  
Planning Task ◽  
Intuitive Interface ◽  
Mating Conditions

Abstract Because of their intuitive interface, mating conditions have been prevalently used in assembly modelling. Besides their use for modelling purposes, other type of information, such as spatial relationships between parts and local degrees of freedom, can be directly derived from mating conditions. This information in turn can be used in various engineering analysis applications, such as kinematics analysis or automatic tolerance chain generation for tolerance analysis. In this paper, application of mating conditions in an assembly sequence-planning task is investigated. The proposed approach mainly engages the mating information represented in the CAD assembly model to automatically generate sequence plans based on the minimization of the number of assembly directions.

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.

A hierarchical parallel multi-station assembly sequence planning method based on GA-DFLA

2020 ◽  
pp. 095440622097406
Author(s):  
Bo Wu ◽  
Peihang Lu ◽  
Jie Lu ◽  
Jinli Xu ◽  
Xiaogang Liu
Keyword(s):  
Hierarchical Structure ◽  
Assembly Line ◽  
Fitness Function ◽  
Information Matrix ◽  
Assembly Sequence Planning ◽  
Planning Method ◽  
Assembly Sequence ◽  
Cost Index ◽  
Sequence Planning ◽  
Structure Tree

In recent years, the parallel assembly sequence planning (PASP) is put forward to accommodate the development of greater variety in the mass-customization production. Although many researchers have made contributions to assembly sequence planning (ASP), how to construct parallel multi-station ASP model to effectively solve the integrated ASP and assembly line balancing (ALB) problem need to be further investigated. In this paper, a hierarchical parallel multi-station assembly sequence planning method based on the genetic algorithm and discrete frog leaping algorithm (GA-DFLA) is proposed to solve the integrated parallel multi-station ASP and ALB problem. The assembly information datasets of the model based definition (MBD) including parts information, hierarchical information, matrix information and resource information are defined firstly. Then the hierarchical structure tree is constructed according to the divided assembly units. The hierarchical parallel multi-station assembly sequence planning is carried out from bottom to top in hierarchical structure tree model using the GA-DFLA. The fitness function with feasibility index, time cost index and assembly line balance index, is proposed to determine a more appropriate solution. Finally, the rear independent suspension is taken as an example to validate this method. The results show that the time of parallel multi-station model is at least 35.27% less than the time of serial multi-station model.

Assembly Modeling and Sequence Planning Based on the Kinematics of Features

1996 ◽  
Author(s):  
Zhi-Kui Ling
Keyword(s):  
Degrees Of Freedom ◽  
Planning Process ◽  
Assembly Sequence Planning ◽  
Degree Of Freedom ◽  
Assembly Planning ◽  
Assembly Sequence ◽  
Assembly Modeling ◽  
Sequence Planning ◽  
Local Degree ◽  
Modeling Strategy

Abstract A feature-based model is proposed for assembly sequence planning automation. The fundamental assembly modeling strategy for a product is based on the mating features of its components. The objectives of this study are to integrate assembly planning of a product with its CAD model, generate a correct and practical assembly sequence, and establish a software system to carry out the planning process. A disassembly approach in assembly planning is used in this study. The degree of freedom information between two mating features is used to characterize their kinematic conditions. The intersection calculation of the degrees of freedom on all features of a component provides its local degree of freedom which is used to set up functional precedence relationship. In some cases where functional precedence relationship can not be detected by geometric reasoning, clipping of the known “common sense” relationship is applied by an user. A bounding box checking approach is used to ensure no global collision during assembly. Furthermore, a set of criteria and heuristic rules based on assembly feasibility, manipulability, assembly direction, cost and stability is used to choose a good assembly sequence.

Research of the Assembly Model Based on Parts Attribute Semantic

2014 ◽  
Vol 509 ◽  
pp. 147-151
Author(s):  
Ya Jun Yang ◽  
Hong Gen Fang ◽  
Hao Luan ◽  
Tian Guo Jin
Keyword(s):  
Competitive Advantage ◽  
Matrix Model ◽  
Assembly Sequence Planning ◽  
Two Dimensional ◽  
Assembly Model ◽  
Assembly Sequence ◽  
Sequence Planning ◽  
Model Based ◽  
Dimensional Matrix ◽  
Precedence Relations

Aiming at the problems in the modeling of assembly sequence planning, this paper proposes a assembly model based on the semantic and two-dimensional matrix which is easy to calculate and expression. The paper complement the parts attribute semantic and it is used to make the assembly model .So the parts about the attributes of parts assembly can be used in the ASP. Assembly relations including Assembly Precedence Relations (APRs), Contact semantic, Connection and Transmission semantic are transformed into a matrix model. Finally shaft structure is used as a example to represent a competitive advantage of this model.

Toward an integrated CAD assembly sequence planning solution

2014 ◽  
Vol 229 (16) ◽  
pp. 2987-3001 ◽  
Author(s):  
Riadh Ben Hadj ◽  
Moez Trigui ◽  
Nizar Aifaoui
Keyword(s):  
Automatic Generation ◽  
Assembly Sequence Planning ◽  
Assembly Model ◽  
Assembly Sequence ◽  
Industrial Products ◽  
Sequence Planning ◽  
Simulation Algorithms ◽  
Great Development

Assembly sequence planning has drawn the attention of many researchers over the last years. Despite, the great development of CAD software in many aspects (simulation algorithms, interfaces, and ergonomics), automatic generation of assembly sequence planning from CAD assembly remains an issue to improve especially with the increasing complexity of industrial products. In this paper, an approach of assembly sequence planning generation from a CAD assembly model is presented. In order to generate feasible assembly sequence planning, the developed approach begins with the exploration of CAD assembly. Then, a collision analysis is performed to identify all possible obstacles during the components’ motion. An example of CAD assembly is presented in all sections of this paper in order to demonstrate the efficiency of the proposed approach.

scholarly journals Solving Assembly Sequence Planning Using Distance Evaluated Simulated Kalman Filter

Mekatronika ◽  
2019 ◽  
Vol 1 (2) ◽  
pp. 1-7
Author(s):  
Ainizar Mustafa ◽  
Zuwairie Ibrahim ◽  
Zulkifli Md Yusof ◽  
David Al-Dabass ◽  
Philip Sallis
Keyword(s):  
Kalman Filter ◽  
Search Strategy ◽  
Assembly Sequence Planning ◽  
Assembly Sequence ◽  
Assembly Time ◽  
Sequence Planning ◽  
Measure Estimate

This paper presents an implementation of simulated Kalman filter (SKF) algorithm for optimizing an assembly sequence planning (ASP) problem. The SKF search strategy contains three simple steps; predict-measure-estimate. The main objective of the ASP is to determine the sequence of component installation to shorten assembly time or save assembly costs. Initially, permutation sequence is generated to represent each agent. Each agent is then subjected to a precedence matrix constraint to produce feasible assembly sequence. In this paper, the distance evaluated SKF (DESKF) is proposed for solving ASP problem. The performance of the proposed DESKF is compared against previous works in solving ASP by applying BGSA, BPSO, and MSPSO. Using a case study of ASP, the results show that DESKF outperformed all the algorithms in obtaining the best solution.

Sign in / Sign up

Export Citation Format

Share Document