Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-26T08:33:27.077Z Has data issue: false hasContentIssue false

Design of an experience-based assembly sequence planner for mechanical assemblies

Published online by Cambridge University Press:  01 May 1998

Arun Swaminathan
Affiliation:
The Laboratory for Intelligent Processes and Systems, Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, Texas 78712, USA
Saghir A. Shaikh
Affiliation:
The Laboratory for Intelligent Processes and Systems, Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, Texas 78712, USA
K. Suzanne Barber
Affiliation:
The Laboratory for Intelligent Processes and Systems, Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, Texas 78712, USA

Abstract

This paper presents a design of an assembly sequence planner based on a “plan reuse” philosophy. Most of assembly planning research in the past has attempted to completely plan each problem from scratch. This research shows that stored cases of basic assembly configurations can be applied to a given assembly problem. It is observed that the number of such basic assembly configurations is quite small. The planner divides the assembly into a number of constituent configurations, which are called “loops”. These act as subgoals in its search for solutions. Plans retrieved for all subgoals are fused into a set of plans that are consistent with the constraints implied by each plan. Application specific constraints on the assembly are explicitly handled in the second phase of planning. Mechanisms for assembly representation and implementation details of the planner are also presented.

Type
Research Article
Copyright
© 1998 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)