Dynamic Interference Detection Algorithm for Bearing with Scar

doi:10.16182/j.issn1004731x.joss.18-VR0740

Abstract

Abstract: To solve the dynamic interference detection problem of scar bearing in visual assembly, an efficient dynamic interference inspection algorithm for scar bearing is proposed. The first step is to perform vertex management on the 3D reconstructed scar bearing model through the quad-tree; the second step is to select the appropriate algorithm for the calculation of the maximum interference distance by considering bearing shape and its motion characteristics. The research shows that the algorithm can quickly and efficiently test the dynamic interference and calculate the interference distance for the bearing with scar, which can effectively improve the efficiency of bearing interference inspection and provide a new idea for bearing interference detection.

Key words: bearing wear, interference detection, simulation experiment, real-time calculation

CLC Number:

TP391.4

Jia Jinyuan, Zheng Naihao. Dynamic Interference Detection Algorithm for Bearing with Scar[J]. Journal of System Simulation, 2019, 31(3): 502-510.

References

[1] Cao H, Fan F, Zhou K, et al.Wheel-bearing fault diagnosis of trains using empirical wavelet transform[J]. Measurement (S0263-2241), 2016, 82: 439-449. Doi:10.1016/j.measurement.2016.01.023
[2] 郑轶, 宁汝新, 刘检华, 等. 虚拟装配关键技术及其发展[J]. 系统仿真学报, 2006, 18(3):649-654.
Zheng Yi, Ning R X, Liu J H, et al.Survey on Key Techniques of Virtual Assembly[J]. Journal of System Simulation, 2006, 18(3): 649-654.
[3] Schauer J, Nüchter A.Collision detection between point clouds using an efficient kd tree implementation[J]. Advanced Engineering Informatics (S1474-0346), 2015, 29(3): 440-458.
[4] Kim Y J, Lin M C, Manocha D.Collision Detection[C]// Goswami A., Vadakkepat P. Humanoid Robotics: A Reference. Dordrecht: Springer, 2017: 1-24.
[5] Bender J, Müller M, Otaduy M A, et al.A survey on position‐based simulation methods in computer graphics[C]// Computer graphics forum. 2014, 33(6): 228-251.
[6] Aurelien B, Eric G.Fast Distance Computation Between a Point and Cylinders, Cones, Line-Swept Spheres and Cone-Spheres[J]. Journal of Graphics Tools (S2165-3488), 2004, 9(2): 11-19.
[7] Busé L, Galligo A, Zhang J.Extraction of cylinders and cones from minimal point sets[J]. Graphical Models (S1524-0703), 2016, 86: 1-12.
[8] Qian K, Yang X, Zhang J, et al.An Adaptive Spherical Collision Detection and Resolution Method for Deformable Object Simulation[C]// Computer-Aided Design and Computer Graphics (CAD/Graphics), 2015 14th International Conference on. IEEE, 2015: 8-17.
[9] Wong T H, Leach G, Zambetta F.An adaptive octree grid for GPU-based collision detection of deformable objects[J]. The Visual Computer (S1432-2315), 2014, 30(6/7/8): 729-738.
[10] Cai P, Indhumathi C, Cai Y, et al.Collision Detection Using Axis Aligned Bounding Boxes[M]// Simulations, Serious Games and Their Applications. Singapore, Springer, 2014:1-14.
[11] Oswald F B, Zaretsky E V, Poplawski J V.Interference- fit life factors for roller bearings[J]. Tribology Transactions (S1547-397X), 2009, 52(4): 415-426.
[12] David E. Distance to Circles in 3D [EB/OL]. (2015-05-31) [2018-06-29]. https://www.geometrictools. com/ Documentation/DistanceToCircle3.pdf.