• Title/Summary/Keyword: Tool path planning

Search Result 89, Processing Time 0.03 seconds

Development of Mission Analysis and Design Tool for ISR UAV Mission Planning (UAV 감시정보정찰 임무분석 및 설계 도구 개발)

  • Kim, Hongrae;Jeon, Byung-Il;Lee, Narae;Choi, Seong-Dong;Chang, Young-Keun
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.42 no.2
    • /
    • pp.181-190
    • /
    • 2014
  • The optimized flight path planning which is appropriate for UAV operation with high performance and multiplex sensors is required for efficient ISR missions. Furthermore, a mission visualization tool is necessary for the assessment of MoE(Measures of Effectiveness) prior to mission operation and the urgent tactical decision in peace time and wartime. A mission visualization and analysis tool was developed by combining STK and MATLAB, whose tool was used for UAV ISR mission analyses in this study. In this mission analysis tool, obstacle avoidance and FoM(Figure of Merit) analysis algorithms were applied to enable the optimized mission planning.

An Optimal Tool Selection Method for Pocket Machining (포켓형상가공을 위한 최적공구 선정방법)

  • Kyoung, Young-Min;Cho, Kyu-Kab;Jun, Cah-Soo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.14 no.7
    • /
    • pp.49-58
    • /
    • 1997
  • In process planning for pocket machining, the selection of tool size, tool path, overlap distance, and the calculation of machining time are very important factors to obtain the optimal process planning result. Among those factors, the tool size is the most important one because the others depend on tool size. And also, it is not easy to determine the optimal tool size even though the shape of pocket is simple. Therefore, the optimal selection of tool size is the most essential task in process planning for machining a pocket. This paper presents a method for selecting optimal toos in pocket machining. 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.

  • PDF

Reliability estimation about quality assurance method of radiotherapy planning (방사선치료계획 정도관리 방법에 따른 신뢰도 평가)

  • Kim, Jeong-Ho;Kim, Gha-Jung;Yoo, Se-Jong;Kim, Ki-Jin
    • Journal of the Korea Safety Management & Science
    • /
    • v.17 no.1
    • /
    • pp.119-124
    • /
    • 2015
  • According as radiation therapy technique develops, standardization of radiation therapy has been complicated by the plan QA(Quality Assurance). However, plan QA tools are two type, OADT (opposite accumulation dose tool) and 3DADT (3 dimensional accumulation dose tool). OADT is not applied to evaluation of beam path. Therefore tolerance error of beam path will establish measurement value at OADT. Plan is six beam path, five irradiation field at each beam path. And beam path error is 0 degree, 0.2 degree, 0.4 degree, 0.6 degree, 0.6 degree, 0.8 degree. Plan QA accomplishes at OADT, 3DADT. The more path error increases, the more plan QA error increases. Tolerance error of OADT path is 0.357 using tolerance error of conventional plan QA. Henceforth plan QA using OADT will include beam path error. In addition, It will increase reliability through precise and various plan technique.

Realtime Generation of Grid Map for Autonomous Navigation Using the Digitalized Geographic Information (디지털지형정보 기반의 실시간 자율주행 격자지도 생성 연구)

  • Lee, Ho-Joo;Lee, Young-Il;Park, Yong-Woon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.4
    • /
    • pp.539-547
    • /
    • 2011
  • In this paper, a method of generating path planning map is developed using digitalized geographic information such as FDB(Feature DataBase). FDB is widely used by the Army and needs to be applied to all weapon systems of newly developed. For the autonomous navigation of a robot, it is necessary to generate a path planning map by which a global path can be optimized. First, data included in FDB is analyzed in order to identify meaningful layers and attributes of which information can be used to generate the path planning map. Then for each of meaningful layers identified, a set of values of attributes in the layer is converted into the traverse cost using a matching table in which any combination of attribute values are matched into the corresponding traverse cost. For a certain region that is gridded, i.e., represented by a grid map, the traverse cost is extracted in a automatic manner for each gird of the region to generate the path planning map. Since multiple layers may be included in a single grid, an algorithm is developed to fusion several traverse costs. The proposed method is tested using a experimental program. Test results show that it can be a viable tool for generating the path planning map in real-time. The method can be used to generate other kinds of path planning maps using the digitalized geographic information as well.

A Study on the 3-D CNC Cutting Planning and Simulation by Z-Map Model (Z-Map 모델을 이용한 3차원 CNC 가공계획 및 절삭시뮬레이션에 관한 연구)

  • 송수용;김석일
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1994.10a
    • /
    • pp.683-688
    • /
    • 1994
  • Recently, the Z-Map model has been used widely to represent the three dimensional geometric shape and to achieve the cross-section and point evaluation of the shape. In this paper, the CNC cutting planning and simulation modules for product with three dimensional geometric shape are realized based on the Z-Map model. The realized system has the various capabilities related to the automatic generation of tool path for the rough and finish cutting processes, the automatic elimination of overcut, the automatic generation of CNC program for a machining center and the cutting simulation. Especially, the overcut-free tool path is obtained by using the CL Z-Map models which are composed of the offset surfaces of the geometric shape of product.

  • PDF

Global Path Planning of Mobile Robot Using String and Modified SOFM (스트링과 수정된 SOFM을 이용한 이동로봇의 전역 경로계획)

  • Cha, Young-Youp
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.25 no.4
    • /
    • pp.69-76
    • /
    • 2008
  • The self-organizing feature map(SOFM) among a number of neural network uses a randomized small valued initial weight vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are moved toward the input vector. On the other hand, the modified method in this research uses a predetermined initial weight vectors of the 1-dimensional string, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward the opposite direction of input vector. According to simulation results one can conclude that the method using string and the modified neural network is useful tool to mobile robot for the global path planning.

Generation of Cutting Layers and Tool Selection for 3D Pocket Machining (3차원 포켓가공을 위한 절삭층 형성 및 공구선정)

  • 경영민;조규갑
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.15 no.9
    • /
    • pp.101-110
    • /
    • 1998
  • In process planning for 3D pocket machining, the critical issues for the optimal process planning are the generation of cutting layers and the tool selection for each cutting layers as well as the other factors such as the determination of machining types, tool path, etc. This paper describes the optimal tool selection on a single cutting layer for 2D pocket machining, the generation of cutting layers for 3D pocket machining, the determination of the thickness of each cutting layers, the determination of the tool combinations for each cutting layers and also the development of an algorithm for determining the machining sequence which reduces the number of tool exchanges, which are based on the backward approach. The branch and bound method is applied to select the optimal tools for each cutting layer, and an algorithmic procedure is developed to determine the machining sequence consisting of the pairs of the cutting layers and cutting tools to be used in the same operation.

  • PDF

A Process Planning System for Machining of Dies for Auto-Body Production-Operation Planning and NC Code Post-Processing

  • Dongmok Sheen;Lee, Chang-Ho;Noh, Sang-Do;Lee, Kiwoo
    • International Journal of Precision Engineering and Manufacturing
    • /
    • v.2 no.3
    • /
    • pp.69-78
    • /
    • 2001
  • This paper presents a process and operation planning system and an NC code post-processor for effective machining of press dies for production of cars. Based on the machining feature, major parts of press dies are categorized into 15 groups and a standard process plan is defined for each group. The standard process plan consists of a series of processes where a process is defined as a group of operations that can be done with one setup. Details such as cutting tools, cutting conditions, and tool paths are decided at the operation planning stage. At the final stage of process and operation planning, the NC code post-processor adjusts feedrates along the tool path to reduce machining time while maintaining the quality. The adjustment rule is selected based on the machining load estimated by virtual machining.

  • PDF

The Comparison of Pulled- and Pushed-SOFM in Single String for Global Path Planning (전역경로계획을 위한 단경로 스트링에서 당기기와 밀어내기 SOFM을 이용한 방법의 비교)

  • Cha, Young-Youp;Kim, Gon-Woo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.15 no.4
    • /
    • pp.451-455
    • /
    • 2009
  • This paper provides a comparison of global path planning method in single string by using pulled and pushed SOFM (Self-Organizing Feature Map) which is a method among a number of neural network. The self-organizing feature map uses a randomized small valued initial-weight-vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. On the other hand, the modified SOFM method in this research uses a predetermined initial weight vectors of the one dimensional string, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward or reverse the input vector, by rising a pulled- or a pushed-SOFM. According to simulation results one can conclude that the modified neural networks in single string are useful tool for the global path planning problem of a mobile robot. In comparison of the number of iteration for converging to the solution the pushed-SOFM is more useful than the pulled-SOFM in global path planning for mobile robot.

Development of Optimal Process Planning for Exit Burr Minimization in Milling Operation (절삭가공 시 출구 버어의 최소화를 위한 최적 가공계획 알고리즘의 개발)

  • Kim, Young-Jin;Kim, Ji-Hwan;Jung, Hee-Chul
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.16 no.1
    • /
    • pp.33-39
    • /
    • 2007
  • One of the most important processes is the face milling in processing task. It makes the smooth surface of processed goods. In processing stage, the formation of burr is inevitable. The formed burr decreases a detailed drawing and effects the safety of workers. So, it causes a deburring process for removing and a bottle-neck condition. Therefore, the study which can minimize the generation of burr is needed. In this paper, complex feature, such as line, arc, circle, spline is studied more reality than any other papers. And also, the algorithm which can predict the path of generated burr is established. Moreover, the finality goal is that the system which can produce tool-path minimized has to be developed.