Patent US2534974A successfully refreshed from Google Patents.
Patent US1317769A successfully refreshed from Google Patents.
Patent US4926309A successfully refreshed from Google Patents.
US4926309A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Artificial intelligence for adaptive machining control of surface finish
Assignee: Ford Motor Co
•
Filing: 1988-09-12
•
Granted: 1990-05-15
•
Expires: 2008-09-12
Abstract
Abstract A method of using a mathematical model to adaptively control surface roughness when machining a series of workpieces or segments by: (a) linearizing a geometrical surface roughness model; (b) initializing said model essentially as a function of feed; and (c) subjecting the initialized model to computerized estimation based on roughness and feed values taken from the last machined workpiece, thereby to determine the largest allowable feed for attaining a desired surface roughness in subsequently machined workpieces or segments of the series. The mathematical model is an algorithm of the form R=[1262.79]f 2 /r. The model is linearized and initialized to give the form R=β 1 s R f+β 2 R max where R is the actual roughness and R max is desired roughness, f is actual feed, β 1 and β 2 are coefficients to be updated by estimation, and s R is a scale factor chosen to make the first term have the same order of magnitude as the second term. Computerized estimation is carried out by converting the above initialized linear model to vector matrix notation with provision for the estimated coefficients in the form R n =θ T x n , where R n is measured roughness, x n is a computed vector taken from measured feed, and θ is a vector to be estimated with "T" denoting the transpose of the vector. After inserting roughness and feed values into such vector model, taken from the last machined workpiece, the coefficients are recursively estimated by sequential regression analysis.
Inventors
- 👤 Charles L. Wu
- 👤 Roger K. Haboush
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 16:39
CPC Classifications
G; G05; G05B; G05B19/00; G05B19/02; G05B19/18; G05B19/416; G05B19/4163; G05B2219/00; G05B2219/30; G05B2219/33; G05B2219/33002; G05B2219/37; G05B2219/37402; Y; Y10; Y10S; Y10S706/00; Y10S706/902; Y10S706/903; Y10S706/904
Claims Analysis
Total Claims: 26
Claim 1
Independent Claim
85 words
A method of adaptively controlling feed for a cutting tool to improve the surface finish of a series of machined workpieces, comprising: (a) sensing surface finish and feed information from the first of said workpieces which is undergoing or has undergone surface machining; (b) recursively estimating a feed that would produce a desired surface finish solely as a function of surface roughness; (c) using said estimated feed to machine the next of said series of workpieces; and (d) repeating steps (a)-(c) for each successive workpiece.
Claim 2
Independent Claim
85 words
A method of adaptively controlling feed for a cutting tool to improve the surface finish of a series of machined workpieces, comprising: (a) sensing surface finish and feed information from the first of said workpieces which is undergoing or has undergone surface machining; (b) recursively estimating a feed that would produce a desired surface finish solely as a function of surface roughness; (c) using said estimated feed to machine the next of said series of workpieces; and (d) repeating steps (a)-(c) for each successive workpiece.
Claim 3
Dependent Claim
79 words
The method as in claim 1, in which in step (b) said function is a geometrical model of surface roughness and step (b) is carried out by: (i) linearizing said geometrical model; (ii) initializing said model; and (iii) subjecting the initialized model to computerized estimation based on roughness and feed values taken from the last machined workpiece, thereby to determine the largest allowable feed for attaining a desired surface roughness in subsequently machined workpieces or segments of the series.
Claim 4
Dependent Claim
18 words
The method as in claim 2, in which said geometrical model has the form R=1262.79 f 2 /r.
Claim 5
Dependent Claim
15 words
The method as in claim 2, in which said linearized model has the form: R=≅R(f.sub.o)+[dR(f.sub.o)/df](f-f.sub.o).
Claim 6
Dependent Claim
23 words
The method as in claim 2, in which said initialized model has the form R=β 1 (s R f)+β 2 R max .
Claim 7
Dependent Claim
41 words
The method as in claim 3, in which said model is initialized by (i) setting R equal to R max (desired roughness) and solving for the initial feed, and (ii) placing the initialized feed in the linearized model to complete initialization.
Claim 8
Dependent Claim
16 words
The method as in claim 6, in which the initial feed is 0.0281406 √rR max .
Claim 9
Dependent Claim
103 words
The method as in claim 6, in which linearizing and initializing are carried out by (i) linearizing the static mathematical model using Taylor series expansion techniques, and (ii) substituting the initialized feed in such linearized expression to provide a mathematical model of the form R=β 1 s R f+β 2 R max where R is the measured or updated roughness, β 1 and β 2 are estimated coefficients, s R is a scale factor chosen to make the term s R f in the expression have the same order of magnitude as R, f is feed, and R max is the desired roughness.
Claim 10
Dependent Claim
12 words
The method as in claim 8, in which s=35.53804 √R max /r.
Claim 11
Dependent Claim
64 words
The method as in claim 2, in which computerized estimation of step (c) is carried out by (i) converting said linearized model to vector-matrix notation, (ii) inserting measured roughness and feed values taken from the last machined workpiece or segment into such vector model, and (iii) recursively estimating β 1 and β 2 by sequential regression analysis to provide an updated solution for feed.
Claim 12
Dependent Claim
59 words
The method as in claim 10, in which the converted form of the linearized mathematical model is R n =θ T x n , where R n is measured roughness, θ is the parameter vector of the coefficients β 1 and β 2 , and x n is the computed vector of s R f and R max .
Claim 13
Dependent Claim
80 words
The method as in claim 10, in which recursive estimation is carried out, after inserting measured roughness and feed values to constitute the vector x n , by using sequential regression analysis to update the least squares estimates of θ in the equation: θ n θ n-1 +k n ε n-1 , where θ n-1 is computed from the immediately preceding workpiece or segment, k n is an estimation gain vector, and ε n is a current prediction error vector.
Claim 14
Dependent Claim
72 words
The method as in claim 12, in which k n is equal to P n-1 x n /(x n T P n-1 x n +λ n ), where P n-1 is the covariance matrix of regression errors known from the previous workpiece, x n is the computed vector of s R f from the previous workpiece and R max , and λ n is the discount or forgetting factor derived from theory.
Claim 15
Dependent Claim
39 words
The method as in claim 10, in which ε n =R n -R n , where R n is the measured roughness and R n is the predicted roughness given by R n =θ n-1 T x n .
Claim 16
Dependent Claim
52 words
The method as in claim 13, in which the covariance matrix of parameter estimation errors can be updated by use of the following equation: P n =(I-k n T x n )P n-1 /λ n , where I is the identity matrix, and the other terms are as defined in claim 12.
Claim 17
Dependent Claim
78 words
The method as in claim 12, in which recursive estimation can be improved by modifying k n to have a square root algorithm taking the form k n =g n /(|v n | 2 +λ n ), where g n is S n-1 v n , v n is s n-1 T x n , λ n is a theoretically derived discount factor, and S n is a matrix which is the square root of P n .
Claim 18
Dependent Claim
27 words
The method as in claim 16, in which λ n is chosen to keep Σ n equal to a desired experimentally derived value in the algorithm: ##EQU7##
Claim 19
Dependent Claim
9 words
The method as in claim 16, in which ##EQU8##
Claim 20
Dependent Claim
37 words
The method as in claim 5, in which β 1 is monitored as a predictor of tool failure so that when β 1 equals zero or becomes negative, a message is transmitted to replace the cutting tool.
Claim 21
Dependent Claim
38 words
The method as in claim 11, in which the accuracy of estimating θ is improved by incorporating a forgetting factor λ n chosen to minimize and keep constant the discounted sum of squared model errors Σ n .
Claim 22
Dependent Claim
9 words
The method as in claim 20, in which ##EQU9##
Claim 23
Dependent Claim
111 words
The method as in claim 2, in which said largest allowable feed f is derived by using the largest recursively estimated feed which meets all of the following constraints: (i) resides between user determined minimum and maximum feeds, (ii) provides a feed which does not cause the feed rate to exceed a user determined maximum feed rate, (iii) provides a slenderness ratio which is between user determined minimum and maximum values for such slenderness ratio, (iv) provides that the cutting speed v satisfy the relationship v≧c/f, where c is a built-up edge threshold value, and (v) constrains the feed to be within a prescribed distance from the currently used feed value.
Claim 24
Independent Claim
174 words
A method of using artificial intelligence to obtain adaptive roughness control feed for improving the surface finish of a series of machined workpieces and/or a series of segments on a single workpiece, comprising: (a) initializing a linear computer model of surface roughness as a function of feed by (i) approximating a geometric relationship of centerline average roughness in terms of feed, (ii) estimating an initial feed and linearizing said relationship about such feed estimate, and (iii) converting such linearized model to vector matrix notation with provision for estimated coefficients; (b) interacting (i) measured feed and surface roughness values taken from an external interface with the immediately preceding workpiece or segment in said series, with (ii) estimated coefficient values for said initialized model by use of sequential regression analysis to provide an updated computer model; and (c) solving for the largest allowable feed in the updated model within selected machining parameter constraints for the next workpiece or segment in the series (d) using said largest allowable feed to machine the next sequential workpiece or segment.
Claim 25
Independent Claim
174 words
A method of using artificial intelligence to obtain adaptive roughness control feed for improving the surface finish of a series of machined workpieces and/or a series of segments on a single workpiece, comprising: (a) initializing a linear computer model of surface roughness as a function of feed by (i) approximating a geometric relationship of centerline average roughness in terms of feed, (ii) estimating an initial feed and linearizing said relationship about such feed estimate, and (iii) converting such linearized model to vector matrix notation with provision for estimated coefficients; (b) interacting (i) measured feed and surface roughness values taken from an external interface with the immediately preceding workpiece or segment in said series, with (ii) estimated coefficient values for said initialized model by use of sequential regression analysis to provide an updated computer model; and (c) solving for the largest allowable feed in the updated model within selected machining parameter constraints for the next workpiece or segment in the series (d) using said largest allowable feed to machine the next sequential workpiece or segment.
Claim 26
Dependent Claim
58 words
The method as in claim 23, in which said selected machining parameter constraints are equivalent to a pair of inequalities f 1 ≦f≦f u , where f 1 =max(f min , d/s max , c bue /v, f p -Δ), and f u =min(f max , F max , F max /N, d/s min , f p +Δ).
References Cited (Backward Citations)
US3784798A
Cited
US4031368A
Cited
US4078195A
Cited
US4408280A
Cited
US4547847A
Cited
US4707793A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-05-14 | 1993-11-13 | 1994-05-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-05-14 | 1997-11-13 | 1998-05-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-05-14 | 2001-11-13 | 2002-05-15 | $7700.00 | Window Closed / Lapsed |