Time-optimal CNC tool paths : a mathematical model of machining
Name
48747587-MIT.pdf
Description
Full printable version
Size
27.21 MB
Format
Adobe PDF
Checksum (MD5)
876201ec93946ababfa63cf8af376782
Author(s)
Kim, Taejung, 1969-
Advisor(s)
Sanjay E. Sarma.
Alternative Title
Time-optimal Computer Numerical Control tool paths : a mathematical model of machining
Date Issued
2001
Publisher
Massachusetts Institute of Technology
Abstract
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.
Description
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2001.
Includes bibliographical references (p. 181-188).
Subjects
Mechanical Engineering.
MIT Department
Massachusetts Institute of Technology. Department of Mechanical Engineering
Terms of Use
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.
Persistent DSpace Link
