Contour-parallel offset machining without tool-retractions

Contour-parallel offset (CPO) machining uses successive offsets of the boundary curves of the machining region as the tool-path-elements (TPEs). For the efficiency of the CPO machining, it is very important to minimize the number of tool-retractions, which cause additional tool movements and do not contribute to the actual cutting. Presented in the paper is a CPO tool-path linking algorithm, which guarantees ‘zero’ number of tool-retractions. The algorithm employs the concept of a ‘TPE-net’ providing the information on the parent/child relationships among the TPEs. By planning a route through the TPE-net, a CPO tool-path without tool-retractions can be generated.     

Optimal tool selection for pocket machining in process planning

In process planning for pocket machining, selection of tool size, tool path, cutting width at each tool path, and calculation of machining time are very important factors for optimal process planning. The tool size is the most important factor because the other factors depend on tool size. Therefore, the optimal selection of tool size is the most essential task in pocket machining process planning. This paper presents a method for selecting optimal tools for pocket machining for the components of injection mold. The branch and bound method is applied to select the optimal tools which minimize the machining time by using the range of feasible tools and the breadth-first search.     

Automatic feedrate adjustment for pocket machining

As high-speed machining and unmanned machining become common, the demand for cutting-load regularization increases, so NC machining can be more efficient. To be presented is a simple cutting-load regularization method for pocket machining. As the conventional off-line approaches where cutting-load is predicted and cutting parameters are adjusted before actual cutting, the proposed method requires a cutting force model, which is quite simplified with the function of two independent variables. One is the geometric measure so called 2D chip-load (cutter-engagement angle or effective cutting depth), and the other is the feedrate. Based on the 2D chip-load analysis for the concave line-line segment of the NC tool path, the adjusted feedrate is calculated by using the simplified-cutting force model (SCFM) obtained by the cutting experiment with a tool dynamometer. The concept of the automatic feedrate adjustment (AFA) method to be proposed is very simple, and the implementation requires little effort. Furthermore, the proposed method does not need much calculation time because there are no complex calculations or cutting simulation.     

Traversing the machining graph of a pocket

A simple and linear-time algorithm is presented for solving the problem of traversing a machining graph with minimum retractions encountered in zigzag pocket machining and other applications. This algorithm finds a traversal of the machining graph of a general pocket P with N_h holes, such that the number of retractions in the traversal is no greater than OPT+N_h+N_r, where OPT is the (unknown) minimum number of retractions required by any algorithm and N_r is the number of reducible blocks in P (to be defined in the paper). When the step-over distance is small enough relative to the size of P, N_r becomes zero, and our result deviates from OPT by at most the number of holes in P, a significant improvement over the upper bound 5OPT+6N_h achieved [Proceedings of the Seventh ACM-SIAM Symposium on Discrete Algorithms, 1996; Algorithmica 2000 (26) 19]. In particular, if N_h is zero as well, i.e. when P has no holes, the proposed algorithm outputs an optimal solution. A novel computational modeling tool called block transition graph is introduced to formulate the traversal problem in a compact and concise form. Efficient algorithms are then presented for traversing this graph, which in turn gives rise to the major result.     

Bspline approximation of circle arc and straight line for pocket machining

This article proposes a new method of 2D curve interpolation using non-uniform cubic B-splines particularly adapted to the interpolation of sequences of straight lines and circle arcs. The purpose of this method is to calculate C2 continuous curves adapted to high feedrate pocket machining. Industrially machined pockets usually present simple forms. Generally, the tool path is defined by circle arcs and line segments that introduce slowdowns during machining. Thus, a method for approximating a sequence of line segments and circle arcs using Bspline curves is proposed. The proposed method ensures exact line interpolation, to approach the tool path precisely, to reduce the number of control points and to avoid thickening and oscillation at the connections between line segments and circle arcs. Various applications are presented and numerous tests on machine tools allow the advantages of this method to be illustrated.     

Adaptive tool-path generation of rapid prototyping for complex product models

Rapid prototyping (RP) provides an effective method for model verification and product development collaboration. A challenging research issue in RP is how to shorten the build time and improve the surface accuracy especially for complex product models. In this paper, systematic adaptive algorithms and strategies have been developed to address the challenge. A slicing algorithm has been first developed for directly slicing a Computer-Aided Design (CAD) model as a number of RP layers. Closed Non-Uniform Rational B-Spline (NURBS) curves have been introduced to represent the contours of the layers to maintain the surface accuracy of the CAD model. Based on it, a mixed and adaptive tool-path generation algorithm, which is aimed to optimize both the surface quality and fabrication efficiency in RP, has been then developed. The algorithm can generate contour tool-paths for the boundary of each RP sliced layer to reduce the surface errors of the model, and zigzag tool-paths for the internal area of the layer to speed up fabrication. In addition, based on developed build time analysis mathematical models, adaptive strategies have been devised to generate variable speeds for contour tool-paths to address the geometric characteristics in each layer to reduce build time, and to identify the best slope degree of zigzag tool-paths to further minimize the build time. In the end, case studies of complex product models have been used to validate and showcase the performance of the developed algorithms in terms of processing effectiveness and surface accuracy.     

High speed pocket milling planning by feature-based machining area partitioning

Pocket milling operations are involved in two and a half-dimensional (2.5D) machining. The machining area of a pocket has to be divided into several sub machining regions (SMRs) to effectively select the machining parameters for ordinary or high speed milling. A SMR of a pocket has its own characteristic geometry, which implicitly provides machining features used for the generation of strategies for high speed machining. This paper presents a methodology to partition a pocket machining area, as well as to identify machining features used for planning of high speed pocket machining. To generate the machining strategy, the attributes of machining features are defined, and evaluated through a machining volume slicing method. SMR-based partitioning rules are developed based on the geometric features of a pocket. The proposed partitioning algorithm is applied to both simple and complex shaped pockets. A case pocket volume is divided into several SMRs, represented by a tree structure containing associated information for pocket milling planning.     

Voronoi diagram-based tool path compensations for removing uncut material in 2½D pocket machining

This paper solves the problem of uncut areas, which can arise when 2½D pockets are machined with radial widths of cut greater than half the cutter diameter. Using the Voronoi diagram approach, three types of uncut areas are defined i.e., corner, centre and neck uncut regions. The corner uncut area is further subdivided into five different types, the centre uncut area into four and the neck uncut area into two. Techniques for detecting each type as well as algorithms for generating the tool paths for removing them are developed based on a singularity-free Voronoi diagram approach. These efficient and robust algorithms ensure that no uncut material is left behind even for complex-shaped pockets containing islands. The proposed algorithms even permit the radial width of cut to be increased to its limiting value of tool diameter. Three examples are included to illustrate the procedures for detection and removal of the different types of uncut areas.     

Machining feature recognition and tool-path generation for 3-axis CNC milling

This study develops an effective method for identifying machining features. While recognizing features, the workpiece is sliced at some assigned positions. The sectional curves of the workpiece faces and slicing plane constitute the feature profiles. Not only the isolated machining features but also the intersecting machining features can be identified by the information from these intersection profiles. Moreover, the recognized machining features can be employed for scheduling the manufacturing sequence. Different kinds of tool paths can be automatically generated for various machining features to improve the cutting efficiency.     

Tool-path generation of planar NURBS curves

It has been widely used in CAD field for many years and gradually applied in CAM area with the prevalence of NURBS interpolator equipped in CNC controllers. But few of them provide the tool radius compensation function. In order to achieve the goal of generating tool-path, an algorithm was presented to offset NURBS curves by an optimum process for CAD/CAM systems in this paper. NURBS format is ideal for HSM applications, but not all NURBS outputs are equal and standard. Basically, there are two different ways to generate NURBS tool-paths; one is to fit a NURBS curve to the conventional tool-path output, the other one is to generate a NURBS tool-path from the start. The main targets for the tool-path of this paper are: (1) To keep a constant distance d between progenitor curve C(t) and offset curve C_d(t) on the normal direction of C(t); (2) to alternate the order k of the basis function in offset curve C_d(t); (3) to oscillate the number of control points of offset curve C_d(t) and compare it with progenitor curve C(t). In order to meet the tolerance requirements as specified by the design, this study offsets the NURBS curves by a pre-described distance d. The principle procedure consists of the following steps: (1) construct an evaluating bound error function; (2) sample offset point-sequenced curves based on first derivatives; (3) give the order of NURBS curve and number of control points to compute all initial conditions and (4) optimize the control points by a path searching algorithm.     

A corner-looping based tool path for pocket milling

In milling around corners, cutting resistance rises momentarily due to an increase of cutter contact length. NC tool path generation in dealing with sharp corners thus requires special consideration. This paper describes an improved NC tool path pattern for pocket milling. The basic pattern of the improved tool path is a conventional contour-parallel tool path. Bow-like tool path segments are appended to the basic tool path at the corner positions. When reaching a corner, the cutter loops around the appended tool path segments so that corner material is removed progressively in several passes. By using the corner-looping based tool path, cutter contact length can be controlled by adjusting the number of appended tool path loops. The procedures of creating the improved tool path for different corner shapes are explained. The proposed tool path generation was implemented as an add-on user function in a CAD/CAM system. Cutting tests were conducted to demonstrate and verify the significance of the proposed method.     

一种OFDM系统定时偏移估计新算法

提出一种利用时域训练序列的定时估计算法。在分析Schimdl算法和Minn算法的缺点的同时,提出了算法,并在两种信道中进行了仿真,仿真结果表明算法在性能上有所提高。     

Tool-path generation for sidewall machining

Presented in this paper is a tool-path generation procedure for sidewall machining, a process that is essential in the fabrication of many mechanical parts. While sculptured surface machining has received a significant amount of attention, there has been relatively less study of the technological requirements of sidewall machining. In this paper, three technological requirements are identified: (1) machining clean-up regions after rough machining, (2) avoiding unbalanced tool wear, and (3) retaining down-milling. For the generation of a roughing tool-path, the PWID offset algorithm is utilized. After roughing, it is necessary to identify the clean-up regions. Identifying these regions requires two major computations: a 2D-curve offsetting and a 2D-booleaning operation. To avoid these heavy operations, this paper proposes a method that identifies clean-up regions by making use of the byproducts (interfering ranges) of the PWID offset algorithm. As a result, it is possible to identify clean-up regions efficiently with minimum effort.     

Computation of Offset Curves by the Huygens Principle

A new algorithm for computing offset curves is proposed. The algorithm is based on the Huygens principle for propagating wave-fronts. It automatically avoids the topological singularities that appear in conventional methods. The algorithm is simple to implement and it does not require any multiplication or other floating number operations.     

Polygon subdivision for pocket machining process planning

This paper presents a new approach to improve tool selection for arbitrary shaped pockets based on an approximate polygon subdivision technique. The pocket is subdivided into smaller sub-polygons and tools are selected separately for each sub-polygon. A set of tools for the entire pocket is obtained based on both machining time and the number of tools used. In addition, the sub-polygons are sequenced to eliminate the requirement of multiple plunging operations. In process planning for pocket machining, selection of tool sizes and minimizing the number of plunging operations can be very important factors. The approach presented in this paper is an improvement over previous work in its use of a polygon subdivision strategy to improve the machining time as well as reducing the number of plunges. The implementation of this technique suggests that using a subdivision approach can reduce machining time when compared to solving for the entire polygonal region.     

一种基于主动生长的边缘连接算法*

针对因漏检而断裂的图像边缘图中的边缘连接问题,提出基于主动生长的边缘连接算法。先检测边缘图中端点的位置和方向,再在端点处进行主动边缘生长并通过退化操作实现边缘的正确连接;通过退化和约束生长实现对边缘图的去噪处理。实验表明,本算法在不增加边缘图噪声的情况下,很好地实现了对断裂边缘的有效连接,有利于后续的图像分割、表达和匹配等处理。     

Efficient feature-based process planning for sculptured pocket machining

Feature is recently known as the core concept necessary to realize a fully integrated CAD/CAM system. The information contents in a feature can be easily conveyed from one application to another in the manufacturing domain. However the feature generated in one application may not be suitable for another without being modified with more information. The objective of the paper is to present the methodology of decomposing bulky features of the sculptured shape of pocket to be removed into compact features to be efficiently machined. It is possible to reactively and efficiently machine the sculptured shape of pocket by segmenting horizontally and vertically a bulky feature and by applying variable cutting condition to each feature.     

An automatic key discovery approach for data linking

In the context of Linked Data, different kinds of semantic links can be established between data. However when data sources are huge, detecting such links manually is not feasible. One of the most important types of links, the identity link, expresses that different identifiers refer to the same real world entity. Some automatic data linking approaches use keys to infer identity links, nevertheless this kind of knowledge is rarely available. In this work we propose KD2R, an approach which allows the automatic discovery of composite keys in RDF data sources that may conform to different schemas. We only consider data sources for which the Unique Name Assumption is fulfilled. The obtained keys are correct with respect to the RDF data sources in which they are discovered. The proposed algorithm is scalable since it allows the key discovery without having to scan all the data. KD2R has been tested on real datasets of the international contest OAEI 2010 and on datasets available on the web of data, and has obtained promising results.     

An epitrochoidal pocket—A new canned cycle for CNC milling machines

A machining strategy for milling a particular set of pockets with epitrochoidal boundary is proposed. The method is suitable to be integrated into the controller of a CNC milling machine and is particularly useful for machining chambers of rotary internal combustion engines (Wankel), rotary piston pumps and generally epitrochoidal-shaped housings. Motion generation is achieved by an algorithm which utilizes real-time CNC interpolation providing the highest possible accuracy, of which the milling machine is capable. The surface quality is controlled by applying roughing and finishing passes. The whole machining task can be programmed in a single block of the part program. Finally, the effectiveness of the proposed method is verified by simulation tests of the generated tool path.