Planning the GMAW process by constraint propagation |
| |
Authors: | NAGARJUN V. YETUKURI GARY W. FISCHER |
| |
Affiliation: | (1) Invenio Design & Development, GM-NAO Seat Engineering Team, Warren, MI 48092, USA;(2) 4108 EB, Department of Industrial Engineering, The University of Iowa, Iowa City, IA 52242, USA |
| |
Abstract: | Although the gas metal arc welding (GMAW) process is widely used for joining metals, its planning is still a cumbersome task. The planning procedure involves many complex interrelationships among the process variables and depends heavily on empirical knowledge. Therefore, a solution method that allows a convenient way to represent the domain knowledge and evaluate the process variable relationships is needed. Further, the lack of a strong domain theory to quantify these interrelationships is a deficiency in the planning of the GMAW process. This paper presents a solution method that overcomes this deficiency and introduces a convenient knowledge representation scheme. The solution method considers the planning procedure to be a constraint satisfaction problem (CSP). The AC-4 algorithm is used to obtain arc consistency among nodes in the constraint network and the PC-4 algorithm is applied to obtain path consistency in the network. A modified version of the AC-4 algorithm is developed to reduce the search space and correspondingly reduce the computation time. An example is presented to demonstrate the capability of the method and its potential to reduce lead time. |
| |
Keywords: | Constraint satisfaction knowledge representation gas metal arc welding (GMAC) metal inert gas (MIG) welding process design process planning |
本文献已被 SpringerLink 等数据库收录! |
|