Time-optimal CNC tool paths : a mathematical model of machining

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2001.

Bibliographic Details
Main Author: Kim, Taejung, 1969-
Other Authors: Sanjay E. Sarma.
Format: Thesis
Language:eng
Published: Massachusetts Institute of Technology 2005
Subjects:
Online Access:http://hdl.handle.net/1721.1/8861
_version_ 1811081951162925056
author Kim, Taejung, 1969-
author2 Sanjay E. Sarma.
author_facet Sanjay E. Sarma.
Kim, Taejung, 1969-
author_sort Kim, Taejung, 1969-
collection MIT
description Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2001.
first_indexed 2024-09-23T11:55:00Z
format Thesis
id mit-1721.1/8861
institution Massachusetts Institute of Technology
language eng
last_indexed 2024-09-23T11:55:00Z
publishDate 2005
publisher Massachusetts Institute of Technology
record_format dspace
spelling mit-1721.1/88612019-04-10T15:42:48Z Time-optimal CNC tool paths : a mathematical model of machining Time-optimal Computer Numerical Control tool paths : a mathematical model of machining Kim, Taejung, 1969- Sanjay E. Sarma. Massachusetts Institute of Technology. Dept. of Mechanical Engineering. Massachusetts Institute of Technology. Dept. of Mechanical Engineering. Mechanical Engineering. Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2001. Includes bibliographical references (p. 181-188). Free-form surface machining is a fundamental but time-consuming process in modern manufacturing. The central question we ask in this thesis is how to reduce the time that it takes for a 5-axis CNC (Computer Numerical Control) milling machine to sweep an entire free-form surface in its finishing stage. We formulate a non-classical variational time-optimization problem defined on a 2-dimensional manifold subject to both equality and inequality constraints. The machining time is the cost functional in this optimization problem. We seek for a preferable vector field on a surface to obtain skeletal information on the toolpaths. This framework is more amenable to the techniques of continuum mechanics and differential geometry rather than to path generation and conventional CAD/CAM (Computer Aided Design and Manufacturing) theory. After the formulation, this thesis derives the necessary conditions for optimality. We decompose the problem into a series of optimization problems defined on 1-dimensional streamlines of the vector field and, as a result, simplify the problem significantly. The anisotropy in kinematic performance has a practical importance in high-speed machining. The greedy scheme, which this thesis implements for a parallel hexapod machine tool, uses the anisotropy for finding a preferable vector field. (cont.) Numerical integration places tool paths along its integral curves. The gaps between two neighboring toolpaths are controlled so that the surface can be machined within a specified tolerance. A conservation law together with the characteristic theory for partial differential equations comes into play in finding appropriately-spaced toolpaths, avoiding unnecessarily-overlapping areas. Since the greedy scheme is based on a local approximation and does not search for the global optimum, it is necessary to judge how well the greedy paths perform. We develop an approximation theory and use it to economically evaluate the performance advantage of the greedy paths over other standard schemes. In this thesis, we achieved the following two objectives: laying down the theoretical basis for surface machining and finding a practical solution for the machining problem. Future work will address solving the optimization problem in a stricter sense. by Taejung Kim. Ph.D. 2005-08-23T15:54:49Z 2005-08-23T15:54:49Z 2001 2001 Thesis http://hdl.handle.net/1721.1/8861 48747587 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 188 p. 15692109 bytes 15691866 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology
spellingShingle Mechanical Engineering.
Kim, Taejung, 1969-
Time-optimal CNC tool paths : a mathematical model of machining
title Time-optimal CNC tool paths : a mathematical model of machining
title_full Time-optimal CNC tool paths : a mathematical model of machining
title_fullStr Time-optimal CNC tool paths : a mathematical model of machining
title_full_unstemmed Time-optimal CNC tool paths : a mathematical model of machining
title_short Time-optimal CNC tool paths : a mathematical model of machining
title_sort time optimal cnc tool paths a mathematical model of machining
topic Mechanical Engineering.
url http://hdl.handle.net/1721.1/8861
work_keys_str_mv AT kimtaejung1969 timeoptimalcnctoolpathsamathematicalmodelofmachining
AT kimtaejung1969 timeoptimalcomputernumericalcontroltoolpathsamathematicalmodelofmachining