• 제목/요약/키워드: Rough cut path planning

검색결과 3건 처리시간 0.019초

저축 CNC 환경에서의 황삭가공 (Rough Cut Tool Path Planning in Fewer-axis CNC Machinig)

  • 강지훈;서석환;이정재
    • 한국CDE학회논문집
    • /
    • 제2권1호
    • /
    • pp.19-27
    • /
    • 1997
  • This paper presents rough cut tool path planning for the fewer-axis machine consisting of a three-axis CNC machine and a rotary indexing table. In the problem dealt with in this paper, the tool orientation is "intermediately" changed, distinguished from the conventional problem where the tool orientation is assumed to be fixed. The developed rough cut path planning algorithm tries to minimize the number of tool orientation (setup) changes together with tool changes and the machining time for the rough cut by the four procedures: a) decomposition of the machining area based on the possibility of tool interference (via convex hull operation), b) determination of the optimal tool size and orientation (via network graph theory and branch-and bound algorithm), c) generation of tool path for the tool and orientation (based on zig-zag pattern), and d) feedrate adjustment to maintain the cutting force at an operation level (based on average cutting force). The developed algorithms are validated via computer simulations, and can be also used in pure fiveaxis machining environment without modification.

  • PDF

신경회로망 방식에 의한 복잡한 포켓형상의 황삭경로 생성 (Neural network based tool path planning for complex pocket machining)

  • 신양수;서석환
    • 한국정밀공학회지
    • /
    • 제12권7호
    • /
    • pp.32-45
    • /
    • 1995
  • In this paper, we present a new method to tool path planning problem for rough cut of pocket milling operations. The key idea is to formulate the tool path problem into a TSP (Travelling Salesman Problem) so that the powerful neural network approach can be effectively applied. Specifically, our method is composed of three procedures: a) discretization of the pocket area into a finite number of tool points, b) neural network approach (called SOM-Self Organizing Map) for path finding, and c) postprocessing for path smoothing and feedrate adjustment. By the neural network procedure, an efficient tool path (in the sense of path length and tool retraction) can be robustly obtained for any arbitrary shaped pockets with many islands. In the postprocessing, a) the detailed shape of the path is fine tuned by eliminating sharp corners of the path segments, and b) any cross-overs between the path segments and islands. With the determined tool path, the feedrate adjustment is finally performed for legitimate motion without requiring excessive cutting forces. The validity and powerfulness of the algorithm is demonstrated through various computer simulations and real machining.

  • PDF

온라인 방식의 공구경로 계획을 내장한 지능형 NURBS 곡면 보간 시스템 (Intelligent NURBS Surface Interpolation System with Embedded Online Tool-Path Planning)

  • 구태훈;지성철
    • 한국정밀공학회지
    • /
    • 제23권9호
    • /
    • pp.156-163
    • /
    • 2006
  • The purpose of this study is to improve the machining of free-formed NURBS surfaces using newly defined G-codes which can directly deal with shapes defined from CAD/CAM programs on a surface basis and specialize in rough and finish cut. To this purpose, a NURBS surface interpolation system is proposed in this paper. The proposed interpolation system includes online tool-path planning, real-time interpolation and feedrate regulation considering an effective machining method and minimum machining time all suitable for unit NURBS surface machining. The corresponding algorithms are simultaneously executed in an online manner. The proposed NURBS surface interpolation system is integrated and implemented with a PC-based 3-axis CNC milling system. A graphic user interface (GUI) and a 3D tool-path viewer which interprets the G-codes for NURBS surfaces and displays whole tool-paths are also developed and included in our real-time control system. The proposed system is evaluated through actual machining in terms of size of NC data, machining time, regulation of feedrate and cutting force focused on finish cut in comparison with the existing method.