Sub-assembly recognition algorithm and performance analysis in assembly sequence planning

Kou, Xiaoxi; Cao, Yan; Wang, Qiangfeng; Hu, Qiao

doi:10.1007/s00170-019-04207-x

Cited by 7 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on the special definition of the position, velocity, and operations of the particle, the iterative update operator of the particles is designed as shown in Equations ( 18) and (19) according to the standard PSO algorithm [24].…”

Section: Iterative Update Of Psomentioning

confidence: 99%

“…The algorithm can easily obtain all the feasible partition schemes by adjusting the threshold of the fuzzy cut-set matrix. Kou et al [19] realized subassembly recognition by iterating and updating the center and fuzzy membership degree matrix of subassemblies. Zhang et al [20] employed a Markov clustering algorithm to discover the candidate subassemblies.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Subassembly Partition of Hull Block Based on Two-Dimensional PSO Algorithm

Lundbäck

et al. 2023

JMSE

View full text Add to dashboard Cite

Subassembly partition is an important process in hull block building as it greatly affects the efficiency and quality of the assembly work. Recently, an experience-based method has been widely applied to the subassembly partition process, which consumes much design time and manpower, thus causing more challenges toward a more highly automated and efficient stage in this process. To shorten the gap, an automated subassembly partition method is presented in this study. First, the assembly information model is defined with essential attributes and topological relations of the parts. Second, an optimization model is established with consideration of a trade-off between the intra-cluster cohesion and cluster number on the premise of satisfying certain constraints. After that, considering the fuzziness and diversity of the subassembly partition problem, a two-dimensional coding discrete particle swarm optimization (PSO) algorithm is developed. Finally, two blocks are demonstrated as instances to verify the proposed method, and the results show that the proposed method is feasible and applicable to the block with a flat structure.

show abstract

Section: Iterative Update Of Psomentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Subassembly Partition of Hull Block Based on Two-Dimensional PSO Algorithm

Lundbäck

et al. 2023

JMSE

View full text Add to dashboard Cite

show abstract

“…e leaf node is a single part, while the root node is the final mechanical product [17]. Besides, there is an assembly directed graph [9,18], whose nodes correspond to the assembly of parts in the assembly and whose arcs correspond to feasible assembly operations [19].…”

Section: Assembly Constraint Modelmentioning

confidence: 99%

Analysis of Assembly Tolerance Based on Assembly Constraint Information Model

2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Mechanical products are composed of two or more parts. The geometric tolerance and dimensional tolerance of each feature in part will affect the assembly performance of the product, which are accumulated and propagated between assembly fit and parts. In this paper, through the secondary development of CAD software, the B-rep model of parts is obtained. The model information is decomposed and simplified based on geometric features to obtain the key information of parts in the assembly process, simplify the operation, and improve the accuracy. Through a directed graph network, the transmission model of assembly error information based on geometrical and dimensional tolerances (GD&T) on the surface of parts is established. Combined with the error transfer characteristics of different geometric surfaces and different error sources, guided by the breadth-first search algorithm and the shortest path theory, the search and establishment of a three-dimensional assembly chain are realized. Finally, the three-dimensional chain is simulated by the Monte Carlo method. The calculation results are compared with the error range obtained by the traditional method to prove the effectiveness of the method.

show abstract

Assembly Path Planning with Obstacle Considering

Ben Said,

Aifaoui

2024

Lecture Notes in Mechanical Engineering

View full text Add to dashboard Cite

Sub-assembly recognition algorithm and performance analysis in assembly sequence planning

Cited by 7 publications

References 9 publications

Subassembly Partition of Hull Block Based on Two-Dimensional PSO Algorithm

Subassembly Partition of Hull Block Based on Two-Dimensional PSO Algorithm

Analysis of Assembly Tolerance Based on Assembly Constraint Information Model

Assembly Path Planning with Obstacle Considering

Contact Info

Product

Resources

About