Tolerance control and propagation for the product assembly modeller

被引:21
作者
Ashiagbor, A [1 ]
Liu, HC [1 ]
Nnaji, BO [1 ]
机构
[1] Univ Massachusetts, Dept Ind Engn & Operat Res, Automat & Robot Lab, Amherst, MA 01003 USA
关键词
D O I
10.1080/002075498193949
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
With the increasing use of computer-aided design (CAD) packages and modellers in engineering have come reduced product lead times and the incorporation of design for manufacturing (DFM) principles leading to concurrent engineering. Until recently, however, most CAD packages have been mainly concerned with accurate design representations in terms of nominal specifications, and the representation of tolerances on these systems in a manner that could be interpreted and used constructively in DFM and other manufacturability analyses have been ignored. This research develops a Tolerance Control and Propagation (TCP) engine for PAM, a product assembly modeller developed by the Automation and Robotics Laboratory. Tolerance control ensures that given individual dimensions, their tolerances and distributions, the designer specified functional dimension tolerance can be met with a specified level of confidence. Tolerance control is performed using Monte-Carlo simulation and the assumption of a beta distributed sum dimension. Although the Monte-Carlo simulation has been previously used for the solution of this problem, the assumption has been that the individual dimensions and their tolerances have been normally distributed. Our approach differs in that various distributions can be selected for each of the dimensions contributing to the sum dimension, thus giving a more accurate result. Tolerance propagation is the opposite of tolerance control, and determines the tolerances to be assigned to those dimensions contributing to a functional or sum dimension such that production cost is minimized. The TCP applies a simulated annealing algorithm to the continuous tolerance optimization problem, using a reciprocal cost function. Simulating annealing algorithms are traditionally applied to discrete optimization problems. Although the solutions obtained are not necessarily the minimum cost solution, the algorithm ensures that all constraints are met and that given the right parameters, a near-optimal solution is found.
引用
收藏
页码:75 / 93
页数:19
相关论文
共 14 条
[1]  
Aarts E., 1989, Wiley-Interscience Series in Discrete Mathematics and Optimization
[2]  
[Anonymous], ENG DESIGN MAT PROCE
[3]  
Bjorke O., 1989, Computer-aided tolerancing
[4]  
Chase K.W., 1988, Manuf Rec, V1, P50
[5]  
Davis L., 1987, GENETIC ALGORITHMS S
[6]   OPTIMAL PROCESS SEQUENCE IDENTIFICATION AND OPTIMAL PROCESS TOLERANCE ASSIGNMENT IN COMPUTER-AIDED PROCESS PLANNING [J].
DONG, Z ;
HU, W .
COMPUTERS IN INDUSTRY, 1991, 17 (01) :19-32
[7]  
DONG Z, 1993, CONCURRENT ENG AUTOM
[8]   OPTIMIZATION BY SIMULATED ANNEALING [J].
KIRKPATRICK, S ;
GELATT, CD ;
VECCHI, MP .
SCIENCE, 1983, 220 (4598) :671-680
[9]  
KUMAR S, 1992, J DESIGN MANUFACTURI, V2
[10]  
LEHTIHET EA, 1989, MANUFACTURING REV, V2, P179