IP Library › Granted Patent US 12,204,308
Granted Patent B2
US 12,204,308 · App. 18/384,209 · Granted Jan 21, 2025

Computerized system and method for generating an undesirable chatter free milling CNC program for use in machining a workpiece

Inventor: Michael Berman (Kfar Yona, IL)
Assignee: SOLIDCAM LTD.
G05B19/404G05B2219/33099G05B2219/41256G05B2219/45145
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,204,308
App. No.
18/384,209
Granted
Jan 21, 2025
Kind
B2
Abstract

A computerized method of machining a workpiece including, prior to machining the workpiece, establishing, based on empirical data obtained from machining activity at an earlier time, an historical mapping indicating pairings of depth of cut and rpm at which undesirable chatter (UDC) did not occur during machining activity at an earlier time using at least one given type of milling machine, at least one given type of cutting tool and at least one given type of workpiece material, prior to commencing machining of the workpiece, programming a machine tool to machine the workpiece using a given type of milling machine, a given type of cutting tool and a given type of workpiece material at at least one depth of cut and rpm, which, based on the historical mapping, avoid UDC and operating the machine tool in accordance with the programming to machine the workpiece.

Claims (32)

1. A computerized method of machining a workpiece comprising:

employing an historical mapping, based on empirical data obtained from machining activity at an earlier time, said historical mapping indicating pairings of depth of cut and rpm at which undesirable chatter (UDC) did occur during machining activity at an earlier time using at least one given type of milling machine, at least one given type of cutting tool and at least one given type of workpiece material;

prior to commencing machining of said workpiece, programming a machine tool to machine said workpiece using one of said at least one given type of milling machine, one of said at least one given type of cutting tool and one of said at least one given type of workpiece material at at least one depth of cut and rpm, which, based on said historical mapping, avoid undesirable chatter, said programming comprising ascertaining a suitable rpm for a given depth of cut, which will not create UDC, by employing a plurality of known pairings of depth of cut and rpm, which plurality of known pairings are known to create UDC, from said historical mapping for said given type of milling machine, said given type of cutting tool and said given type of workpiece material; and

operating said machine tool in accordance with said programming to machine said workpiece.

2. A computerized method of machining a workpiece according to claim 1 and wherein said programming also comprises:

employing an additional plurality of known pairings of depth of cut and rpm, which are known from said historical mapping for said given type of milling machine, said given type of cutting tool and said given type of workpiece material to be within a predetermined neighborhood of known pairings known not to create UDC and not to be within a predetermined neighborhood of known pairings known to create UDC for said at least one given type of milling machine, said at least one given type of cutting tool and said at least one given type of workpiece material, in order to ascertain a suitable rpm for a given depth of cut which will not create UDC.

3. A computerized method of machining a workpiece according to claim 2 and wherein said suitable rpm for said given depth of cut need not correspond to one of said known pairings.

4. A computerized method of machining a workpiece according to claim 2 and wherein said suitable rpm for said given depth of cut does not correspond to one of said known pairings.

5. A computerized method of machining a workpiece according to claim 1 and wherein said programming also comprises:

initially generating an initial CNC program for machining said workpiece without necessarily considering UDC issues, said initial CNC program including at least one proposed pairing of depth of cut and rpm for at least one given type of milling machine, at least one given type of cutting tool and at least one given type of workpiece material; and

validating said at least one proposed pairing, based on said historical mapping.

6. A computerized method of machining a workpiece according to claim 1 and wherein said programming also comprises:

initially generating an initial CNC program for machining said workpiece without necessarily considering UDC issues, said initial CNC program including at least one proposed pairing of depth of cut and rpm for at least one given type of milling machine, at least one given type of cutting tool and at least one given type of workpiece material;

disallowing at least one of said at least one proposed pairing, based on said historical mapping;

generating at least one revised CNC program for machining said workpiece based on said historical mapping, said initial CNC program including at least one alternative proposed pairing of depth of cut and rpm for at least one given type of milling machine, at least one given type of cutting tool and at least one given type of workpiece material; and

validating said at least one revised proposed pairing, based on said historical mapping.

7. A computerized system for machining a workpiece, said system comprising:

an historic mapping generator operative, prior to machining said workpiece, to generate an historical mapping, based on empirical data obtained from machining activity at an earlier time, indicating pairings of depth of cut and rpm at which undesirable chatter (UDC) did occur during machining activity at an earlier time using at least one given type of milling machine, at least one given type of cutting tool and at least one given type of workpiece material;

a computerized machine tool programmer operative, prior to commencing machining of said workpiece, to generate a machine tool program enabling a machine tool to machine said workpiece using one of said at least one given type of milling machine, one of said at least one given type of cutting tool and one of said at least one given type of workpiece material at at least one depth of cut and rpm, which, based on said historical mapping, avoid undesirable chatter, said computerized machine tool programmer comprising a suitable depth of cut and rpm ascertainer, said ascertainer operative to ascertain a suitable rpm for a given depth of cut which will not create UDC, by employing a plurality of known pairings of depth of cut and rpm, which plurality of known pairings are known to create UDC, from said historical mapping for said given type of milling machine, said given type of cutting tool and said given type of workpiece material; and

a machine tool operable in accordance with said programming to machine said workpiece.

8. A computerized system for machining a workpiece according to claim 7 and wherein said computerized machine tool programmer also comprises:

a suitable depth of cut and rpm ascertainer, employing an additional plurality of known pairings of depth of cut and rpm, which are known from said historical mapping for said given type of milling machine, said given type of cutting tool and said given type of workpiece material to be within a predetermined neighborhood of known pairings known not to create UDC and not to be within a predetermined neighborhood of known pairings known to create UDC for said at least one given type of milling machine, said at least one given type of cutting tool and said at least one given type of workpiece material, in order to ascertain a suitable rpm for a given depth of cut which will not create UDC.

9. A computerized system for machining a workpiece according to claim 8 and wherein said suitable rpm for said given depth of cut need not correspond to one of said known pairings.

10. A computerized system for machining a workpiece according to claim 8 and wherein said suitable rpm for said given depth of cut does not correspond to one of said known pairings.

11. A computerized system for machining a workpiece according to claim 7 and wherein said computerized machine tool programmer also comprises:

an initial CNC program generator, initially generating an initial CNC program for machining said workpiece without necessarily considering UDC issues, said initial CNC program including at least one proposed pairing of depth of cut and rpm for at least one given type of milling machine, at least one given type of cutting tool and at least one given type of workpiece material; and

a proposed pairing validator, validating said at least one proposed pairing, based on said historical mapping.

12. A computerized system for machining a workpiece according to claim 7 and wherein said computerized machine tool programmer also comprises:

an initial CNC program generator, initially generating an initial CNC program for machining said workpiece without necessarily considering UDC issues, said initial CNC program including at least one proposed pairing of depth of cut and rpm for at least one given type of milling machine, at least one given type of cutting tool and at least one given type of workpiece material;

a proposed pairing disallower, disallowing at least one of said at least one proposed pairing, based on said historical mapping;

a revised CNC program generator, generating at least one revised CNC program for machining said workpiece based on said historical mapping, said initial CNC program including at least one alternative proposed pairing of depth of cut and rpm for at least one given type of milling machine, at least one given type of cutting tool and at least one given type of workpiece material; and

a revised proposed pairing validator, validating said at least one revised proposed pairing, based on said historical mapping.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 26, 2023
From: BERMAN, MICHAEL
To: SOLIDCAM LTD.
Reel/Frame 065359/0254 →
Continuity (5)
Continuation 17991093 · Nov 21, 2022
Continuation 17358299 · Jun 25, 2021
Continuation 16527550 · Jul 31, 2019
Continuation 15525514
Related Publication 20240061395A1 · Feb 22, 2024
References Cited (94)
US 4200015A · Gerber · 1980 [cited by applicant]
US 4531192A · Cook · 1985 [cited by applicant]
US 4542328A · Pouyet · 1985 [cited by applicant]
US 4605886A · Inoue · 1986 [cited by applicant]
US 4608476A · Shimizu · 1986 [cited by applicant]
US 4618924A · Hinds · 1986 [cited by applicant]
US 4745558A · Kishi et al. · 1988 [cited by applicant]
US 4785153A · Stimmel · 1988 [cited by applicant]
US 4833617A · Wang · 1989 [cited by applicant]
US 4837703A · Kakazu et al. · 1989 [cited by applicant]
US 4870561A · Love et al. · 1989 [cited by applicant]
US 4907164A · Guyder · 1990 [cited by applicant]
US 4985840A · Shinozaki · 1991 [cited by applicant]
US 5043906A · Jepson · 1991 [cited by applicant]
US 5091861A · Geller · 1992 [cited by applicant]
US 5170358A · Delio · 1992 [cited by examiner]
US 5251143A · Maeda · 1993 [cited by applicant]
US 5297022A · Watanabe · 1994 [cited by applicant]
US 5351196A · Sowar et al. · 1994 [cited by applicant]
US 5515290A · Honda · 1996 [cited by applicant]
US 5526272A · Kondo · 1996 [cited by applicant]
US 5565749A · Jinno · 1996 [cited by applicant]
US 5596504A · Tata · 1997 [cited by applicant]
US 5703782A · Dundorf · 1997 [cited by applicant]
US 5768136A · Fujiwara · 1998 [cited by applicant]
US 5796618A · Maeda et al. · 1998 [cited by applicant]
US 5808263A · Beltrami · 1998 [cited by applicant]
US 6007280A · Asahi · 1999 [cited by applicant]
US 6065858A · Yamaguchi et al. · 2000 [cited by applicant]
US 6112133A · Fishman · 2000 [cited by applicant]
US 6266572B1 · Yamazaki et al. · 2001 [cited by applicant]
US 6311100B1 · Sarma · 2001 [cited by applicant]
US 6363298B1 · Shin et al. · 2002 [cited by applicant]
US 6447223B1 · Farah et al. · 2002 [cited by applicant]
US 6591156B1 · Fukaya · 2003 [cited by applicant]
US 6591158B1 · Bieterman et al. · 2003 [cited by applicant]
US 7012395B2 · Haunerdinger et al. · 2006 [cited by applicant]
US 7149599B2 · Arai · 2006 [cited by applicant]
US 7450127B2 · Hong · 2008 [cited by applicant]
US 7451013B2 · Coleman et al. · 2008 [cited by applicant]
US 7577490B2 · Diehl et al. · 2009 [cited by applicant]
US 7693588B2 · Hong · 2010 [cited by applicant]
US 7831332B2 · Diehl · 2010 [cited by applicant]
US 8000834B2 · Diehl · 2011 [cited by applicant]
US 8011864B2 · Olgac · 2011 [cited by examiner]
US 8489224B2 · Berman · 2013 [cited by applicant]
US 9052704B2 · Berman et al. · 2015 [cited by applicant]
US 9292626B2 · Nelaturi et al. · 2016 [cited by applicant]
US 9823645B2 · Berman et al. · 2017 [cited by applicant]
US 9833868B2 · Hwang · 2017 [cited by examiner]
US 10416648B2 · Berman · 2019 [cited by applicant]
US 11048224B2 · Berman · 2021 [cited by applicant]
US 11550292B2 · Berman · 2023 [cited by applicant]
US 11841693B2 · Berman · 2023 [cited by applicant]
US 20020146296A1 · Schmitz · 2002 [cited by examiner]
US 20050256604A1 · Diehl et al. · 2005 [cited by applicant]
US 20060159538A1 · Wang · 2006 [cited by examiner]
US 20070179661A1 · Onozuka · 2007 [cited by examiner]
US 20080269943A1 · Diehl et al. · 2008 [cited by applicant]
US 20100161107A1 · Kappmeyer · 2010 [cited by examiner]
US 20100191359A1 · Diehl et al. · 2010 [cited by applicant]
US 20110178629A1 · Diehl · 2011 [cited by applicant]
US 20120093603A1 · Ueno · 2012 [cited by examiner]
US 20130046405A1 · Shamoto · 2013 [cited by examiner]
US 20130151000A1 · Mackman · 2013 [cited by applicant]
US 20130262066A1 · Erdim et al. · 2013 [cited by applicant]
US 20130272812A1 · Hamada · 2013 [cited by examiner]
US 20130345853A1 · Berman et al. · 2013 [cited by applicant]
US 20140202293A1 · Van Handel · 2014 [cited by examiner]
US 20140364990A1 · Lee · 2014 [cited by examiner]
US 20140364991A1 · Lee · 2014 [cited by examiner]
US 20150306720A1 · Ono · 2015 [cited by examiner]
US 20160161936A1 · Lee · 2016 [cited by examiner]
US 20160288285A1 · Piner · 2016 [cited by examiner]
US 20180052439A1 · Chen · 2018 [cited by examiner]
US 20180292804A1 · Berman · 2018 [cited by applicant]
US 20190354078A1 · Berman · 2019 [cited by applicant]
US 20210389746A1 · Berman · 2021 [cited by applicant]
US 20230081968A1 · Berman · 2023 [cited by applicant]
WO 2016025963 · 2016 [cited by applicant]
WO WO2016025963A1 · 2016 [cited by examiner]
WO 2018173030 · 2018 [cited by applicant]
An International Search Report and a Written Opinion both dated Jun. 26, 2017, which issued during the prosecution of Applicant's PCT/IL2017/050345. [cited by applicant]
An Office Action dated Nov. 2, 2018, which issued during the prosecution of U.S. Appl. No. 15/525,514. [cited by applicant]
Notice of Allowance dated Aug. 20, 2018, which issued during the prosecution of Australian Patent Application No. 2014313756. [cited by applicant]
Notice of Allowance dated Feb. 4, 2019, which issued during the prosecution of U.S. Appl. No. 15/729,230. [cited by applicant]
European Search Report dated Dec. 5, 2018 which issued during the prosecution of Applicant's European App No. 12752319.9. [cited by applicant]
Notice of Allowance dated May 31, 2019, which issued during the prosecution of U.S. Appl. No. 15/525,514. [cited by applicant]
An International Preliminary Report on Patentability dated Sep. 24, 2019, which issued during the prosecution of Applicant's PCT/IL2017/050345. [cited by applicant]
An Office Action dated September 4. 2020, which issued during the prosecution of U.S. Appl. No. 15/527,550. [cited by applicant]
Notice of Allowance dated Mar. 3, 2021, which issued during the prosecution of U.S. Appl. No. 15/527,550. [cited by applicant]
Notice of Allowance dated Aug. 4, 2023, which issued during the prosecution of U.S. Appl. No. 17/991,093. [cited by applicant]
An Office Action dated Aug. 26, 2022, which issued during the prosecution of U.S. Appl. No. 17/358,299. [cited by applicant]
An Office Action dated Apr. 25, 2023, which issued during the prosecution of U.S. Appl. No. 17/991,093. [cited by applicant]