Algorithms for the minimization of setups and tool changes in “simply fixturable” components in milling

Fixture planning is a complex task and has been a major stumbling block in the development of efficient automated planning systems. However, the recent emergence of universal fixturing techniques has provided hardware solutions to problems previously handled through software. These techniques permit...

Full description

Saved in:
Bibliographic Details
Published in:Journal of manufacturing systems 1996-01, Vol.15 (2), p.95-112
Main Authors: Sarma, Sanjay E., Wright, Paul K.
Format: Article
Language:English
Subjects:
Algorithms
Automation
CAD
CAM
Computer aided design
Computer aided manufacturing
Flexibility
Machine tools
Manufacturing
Planning Algorithms
Process Planning
Setups
Studies
Tool Changes
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Fixture planning is a complex task and has been a major stumbling block in the development of efficient automated planning systems. However, the recent emergence of universal fixturing techniques has provided hardware solutions to problems previously handled through software. These techniques permit the workpiece to be immobilized in any given orientation regardless of its shape. Components in which fixturing concerns can be ignored during planning are referred to as “simply fixturable”. In simply fixturable components, the entire space of feasible plans can be captured in a single unified graph-theoretic representation. In this paper, a robust graph-theoretic model of planning is presented along with a new hierarchical prioritization of the objectives in planning. This permits efficient yet comprehensive searches for near-optimal plans that minimize multiple objectives. Algorithms are presented for selecting the access faces for features, minimizing the number of setups, minimizing the number of tool changes, and merging setup plans with preferable squaring routines. An attempt is made to maintain theoretical soundness in these algorithms so that a variety of situations can be handled gracefully.
ISSN:0278-6125
1878-6642
DOI:10.1016/0278-6125(96)82335-1