Institute for Systems Research

Permanent URI for this communityhttp://hdl.handle.net/1903/4375

Browse

Search Results

Now showing 1 - 9 of 9
  • Thumbnail Image
    Item
    A Geometric Algorithm for Multi-Part Milling Cutter Selection
    (2000) Yao, Zhiyang; Gupta, Satyandra K.; Nau, Dana S.; ISR
    Mass customization results in smaller batch sizes in manufacturing that require large numbers of setup and tool changes. The traditional process planning that generates plans for one part at a time is no longer applicable.

    In this paper, we propose the idea of process planning for small batch manufacturing, i.e., we simultaneously consider multiple parts and exploit opportunities for sharing manufacturing resources such that the process plan will be optimized over the entire set of parts. In particular, we discuss a geometric algorithm for multiple part cutter selection in 2-1/2D milling operations.

    We define the 2-1/2D milling operations as covering the target region without intersecting with the obstruction region. This definition allows us to handle the open edge problem. Based on this definition, we first discuss the lower and upper bond of cutter sizes that are feasible for given parts. Then we introduce the geometric algorithm to find the coverable area for a given cutter. Following that, we discuss the approach of considering cutter loading time and changing time in multiple cutter selection for multiple parts. We represent the cutter selection problem as shortest path problem and use Dijkstra's algorithm to solve it. By using this algorithm, a set of cutters is selected to achieve the optimum machining cost for multiple parts.

    Our research illustrates the multiple parts process planning approach that is suitable for small batch manufacturing. At the same time, the algorithm given in this paper clarifies the 2-1/2D milling problem and can also help in cutter path planning problem.

  • Thumbnail Image
    Item
    Selecting Flat End Mills for 2-1/2D Milling Operations
    (2000) Yao, Zhiyang; Gupta, Satyandra K.; Nau, Dana S.; ISR
    The size of milling cutter significantly affects the machining time. Therefore, in order to perform milling operations efficiently, we need to select a set of milling cutters with optimal sizes. It is difficult for human process planners to select the optimal or near optimal set of milling cutters due to complex geometric interactions among tools size, part shapes, and tool trajectories.

    In this paper, we give a geometric algorithm to find the optimal cutters for 2-1/2D milling operations. We define the 2-1/2D milling operations as covering the target region without intersecting with the obstruction region. This definition allows us to handle the open edge problem. Based on this definition, we introduced the offsetting and inverse-offsetting algorithm to find the coverable area for a given cutter. Following that, we represent the cutter selection problem as shortest path problem and discuss the lower and upper bond of cutter sizes that are feasible for given parts. The Dijkstra's algorithm is used to solve the problem and thus a set of cutters is selected in order to achieve the optimum machining cost.

    We believe the selection of optimum cutter combination can not only save manufacturing time but also help automatic process planning.

  • Thumbnail Image
    Item
    A Geometric Algorithm for Finding the Largest Milling Cutter
    (2000) Yao, Zhiyang; Gupta, Satyandra K.; Nau, Dana S.; ISR
    In this paper, we describe a new geometric algorithm to determine the largest feasible cutter size for2-D milling operations to be performed using a single cutter. In particular:

    1. We give a general definition of the problem as the task of covering a target region without interfering with anobstruction region. This definition encompasses the task of milling a general 2-D profile that includes bothopen and closed edges.

    2. We discuss three alternative definitions of what it means for a cutter to be feasible, and explain which of thesedefinitions is most appropriate for the above problem.

    3. We present a geometric algorithm for finding the maximal cutter for 2-D milling operations, and we show thatour algorithm is correct.

  • Thumbnail Image
    Item
    A Feature Based Approach to Automated Design of Multi-Piece Sacrificial Molds
    (2000) Dhaliwal, Savinder; Gupta, Satyandra K.; Huang, Jun; Kumar, Malay; ISR
    This report describes a feature-based approach to automated design of multi-piece sacrificial molds. We use multi-piece sacrificial molds to create complex 3D polymer/ceramic parts. Multi-piece molds refer to molds that contain more than two mold components or subassemblies.

    Our methodology has the following three benefits over the state-of-the-art. First, by using multi-piece molds we can create complex 3D objects that are impossible to create using traditional two piece molds. Second, we make use of sacrificial molds. Therefore, using multi-piece sacrificial molds, we can create parts that pose disassembly problems for permanent molds. Third, mold design steps are significantly automated in our methodology. Therefore, we can create the functional part from the CAD model of the part in a matter of hours and so our approach can be used in small batch manufacturing environments.

    The basic idea behind our mold design algorithm is as follows. We first form the desired gross mold shape based on the feature-based description of the part geometry. If the desired gross mold shape is not manufacturable as a single piece, we decompose the gross mold shape into simpler shapes to make sure that each component is manufacturable using CNC machining. During the decomposition step, we account for tool accessibility to make sure that (1) each component is manufacturable, and (2) components can be assembled together to form the gross mold shape. Finally, we add assembly features to mold component shapes to facilitate easy assembly of mold components and eliminate unnecessary degree of freedoms from the final mold assembly.

  • Thumbnail Image
    Item
    Manufacturing Feature Instances: Which Ones to Recognize?
    (1994) Gupta, Satyandra K.; Regli, W.C.; Nau, D.S.; ISR
    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.

    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.

    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.

  • Thumbnail Image
    Item
    Extracting Alternative Machining Features: Al Algorithmic Approach
    (1994) Regli, W.C.; Gupta, Satyandra K.; Nau, D.S.; ISR
    Automated recognition of features from CAD models has been attempted for a wide range of application domains. In this paper we address the problem of representing and recognizing the complete class of features in alternative interpretations for a given design. We present a formalism for representing feature- based design alternatives and a methodology for recognizing a class of machinable features. Our approach handles a class of volumetric features that describe material removal volumes made by operations on the three-axis vertical machining centers including: drilling, pocket-, slot-, and face-miling, chamfering, filleting, and blended surfaces. Our approach recognizes intersecting features, and is complete over all features in our class, i.e. for any given part, the algorithm produces a set containing all features in our class that correspond to possible operations for machining that part. This property is of particular significance in applications where consideration of different manufacturing alternatives is crucial. In addition, we have shown that the algorithms are, in the worst-case, euqdratic in the number solid modeling operations. This approach employs a class of machinable features expressible as MRSEVs ( a STEP- based library of machining features). An implementation of these algorithms has been done using the ACISsolid modeler and the NIH C++ class library.
  • Thumbnail Image
    Item
    Feature Recognition for Manufacturability Analysis
    (1994) Regli, W.C.; Gupta, Satyandra K.; Nau, D.S.; ISR
    While automated recognition of features has been attempted for a wide range of applications, no single existing approach possesses the functionality required to perform manufacturability analysis. In this paper, we present a methodology for taking a CAD model and extracting a set of machinable features suitable for generating all alternative interpretations of the model as collections of MRSEVs (Material Removal Shape Element Volumes, a STEP-based library of machining, features). This set of MRSEVs is to be employed for manufacturability analysis. The algorithm handles a variety of features including those describing holes, pockets, slots, and chamfering and filleting operations. In addition, it considers elementary accessibility constraints for these features and is provably complete over a, significant class of machinable parts the features describe. Further, the approach has low-order polynomial-time worst-case complexity.
  • Thumbnail Image
    Item
    Building MRSEV Models for CAM Applications
    (1993) Gupta, Satyandra K.; Kramer, Thomas R.; Nau, D.S.; Regli, W.C.; Zhang, G.M.; ISR
    Integrating CAD and CAM applications, one major problems is how to interpret CAD information in a manner that makes sense for CAM. Our goal is to develop a general approach that can be used with a variety of CAD and CAM applications for the manufacture of machined parts.

    In particular, we present a methodology for taking a CAD model, extracting alternative interpretations of the model as collections of MRSEVs (Material Removal Shape Element Volumes, a STEP-based library of machining features), and evaluating these interpretations to determine which one is optimal. The evaluation criteria may be defined by the user, in order to select the best interpretation for the particular application at hand.

  • Thumbnail Image
    Item
    Evaluating Product Machinability for Concurrent Engineering
    (1992) Nau, D.S.; Zhang, G.M.; Gupta, Satyandra K.; Karinthi, Raghu R.; ISR
    Decisions made during the design of a machined part can significantly affect the product's cost, quality, and lead time. Thus, in order to address the goals of concurrent engineering, it is important to evaluate the machinability of the proposed design, so that the designer can change the design to improve its machinability, To determine the machinability of the part, all of the possible alternative ways to machine the part should be generated, and their machinability evaluated. This chapter describes the techniques we have developed to do this automatically.

    The information provided by these techniques will prove useful in two ways: (1) to provide information to the manufacturing engineer about alternative ways in which the part might be machined, and (2) to provide feedback to the designer identifying problems that may arise with the machining.