Manufacturing Feature Instances: Which Ones to Recognize?
| dc.contributor.author | Gupta, Satyandra K. | en_US |
| dc.contributor.author | Regli, W.C. | en_US |
| dc.contributor.author | Nau, D.S. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:57:18Z | |
| dc.date.available | 2007-05-23T09:57:18Z | |
| dc.date.issued | 1994 | en_US |
| dc.description.abstract | Manufacturing features and feature-based representations have become an integral part of research on manufacturing systems, largely due to their ability to model correspondences between design information and manufacturing operations. However, several research challenges still must be addressed in order to place feature technologies into a solid scientific and mathematical framework: One challenge is the issue of alternatives in feature- based planning.<P>Even after one has decided upon al abstract set of features to use for representing manufacturing operations, the set of feature instances used to represent a complex part is by no means unique. For a complex part, many (sometimes infinitely many) different manufacturing operations can potentially be used to manufacture various portions of the part - - and thus many different feature instances can be used to represent these portions of the part. Some of these feature instances will appear in useful manufacturing plans, and others will not. If the latter feature instances can be discarded at the outset, this will reduce the number of alternative manufacturing plans to be examined in order to find a useful one. Thus, what is required is a systematic means of specifying which feature instances are of interest.<P>This paper addresses the issue of alternatives by introducing the notion of primary feature instances, which we contend are sufficient to generate all manufacturing plans of interest. To substantiate our argument, we describe how various instances in the primary feature set can be used to produce the desired plans. Furthermore, we discuss how this formulation overcomes computational difficulties faced by previous work, and present some complexity results for this approach in the domain of machined parts. | en_US |
| dc.format.extent | 229627 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/5551 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1994-81 | en_US |
| dc.subject | algorithms | en_US |
| dc.subject | combinatorics | en_US |
| dc.subject | computational complexity | en_US |
| dc.subject | computational geometry | en_US |
| dc.subject | computer aided manufacturing | en_US |
| dc.subject | computer integrated manufacturing | en_US |
| dc.subject | feature extraction | en_US |
| dc.subject | manufacturing | en_US |
| dc.subject | Systems Integration Methodology | en_US |
| dc.title | Manufacturing Feature Instances: Which Ones to Recognize? | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1