US Patent: 3,784,798
|
Adaptive Machining
|
Patentees:
|
Bruce R. Beadle (exact or similar names) - Fond Du Lac, Fond Du Lac County, WI |
John G. Bollinger (exact or similar names) - Madison, Dane County, WI |
Manufacturer: |
Not known to have been produced |
|
Patent Dates:
|
Applied: |
Jul. 03, 1972 |
Granted: |
Jan. 08, 1974 |
USPTO (New site tip) Google Patents
Report data errors or omissions to steward
Joel Havens "Vintage Machinery" entry for Giddings & Lewis Manufacturing Co.
|
Description: |
Foreign Application Priority Data in Great Britain, 09 Nov., 1971.
Abstract:
Methods and apparatus for adaptively controlling a machine tool to provide optimized instantaneous performance as unforeseen or unforeseeable changes in cutting conditions occur; --characterized by a continuous search out of and back into a permissible area defined by constraint boundaries in the cutter speed vs. feed rate (V vs. R) plane. The method and apparatus always adjust the cutter speed and feed rate to conditions of optimized economic operation (e.g., minimum cost or minimum time)--but subject to other limitations of the machine tool, the cutter and the workpiece material--because one such boundary defines the optimum values of cutter speeds and feeds representing minimum cost or minimum time per unit length of machining. The latter boundary is established by straightforward use of empirical contants, available in the literature or readily determined by known techniques, associated with the well known modified Taylor equation. By sensing machine tool variable and signaling actual values of a plurality of operating parameters, the output rate of the machine tool is increased until the economic restraint, or some other inherent limitation restraint, is reached. The corrective action to remove any constraint violation is based upon a grouping of the several signaled parameters according to the shapes of the respective boundary lines corresponding thereto in the V, R plane, so that the method steps for effecting correction of any constraint boundary violation are relatively few in number and may be carried out by novel apparatus which is simple and practical.
|
|