USPatent applicationPatented

System and method for predicting remaining useful life of component of equipment

Granted 16 Apr 2019 · 2 office actions

Life of the application

11 dated events
⤢ drag to zoom20162018202020222024202620282030203220342036ProsecutionOwnershipTerm & fees
ProsecutionOwnershipTerm & feeshover for detail · click to open

Abstract

A system and a method for predicting a remaining useful life (RUL) of a component of an equipment are provided. The system for predicting the RUL of the component of the equipment includes a data acquisition unit, a feature capturing unit, a mapping function generating unit, a similarity analyzing unit and a RUL calculating unit. The feature capturing unit obtains an estimation feature according to a real time sensing record, and obtains a plurality of training features according to a set of history sensing records. The similarity analyzing unit obtains k similar features which are similar to the estimation feature according to the training features. The RUL calculating unit obtains at least one of k predicting information via a mapping function according to the k similar features and calculates an estimation RUL according to at least one predicting value.

Description

7 parts
›This application claims the benefit of Taiwan application…

This application claims the benefit of Taiwan application Serial No. 104140980, filed Dec. 7, 2015, the disclosure of which is incorporated by reference herein in its entirety.

›TECHNICAL FIELD

The disclosure relates in general to a predicting system and a predicting method, and more particularly to a system and a method for predicting a remaining useful life (RUL) of a component of an equipment.

›BACKGROUND

Manufacturing is one of the top 5 big data markets, in which the market share of manufacturing is about 10%. According to one reach, the failure of the important equipment is the main factor that influences the operation of the company. If one can analyze the failure of the important equipment, the operation efficiency can be improved and the competitiveness of enterprises can be greatly increased.

Prognostics and health management can be used to monitor and evaluate the state of the equipment (or its component). The time to maintain or replace a component can be decided by the state of the equipment (or its component) in order to reduce unscheduled downtime. More specifically, if the remaining useful life of the component can be accurately predicted, the component can be maintained or replaced in advance. However, the amount of data of some of the components may not be enough and the variability of the failure of the components is high, such that the predicting model is difficult to be obtained. Therefore, accurately predicting the remaining useful life according to little data is an important issue nowadays.

›SUMMARY

The disclosure is directed to a system and a method for predicting a remaining useful life (RUL) of a component of an equipment.

According to one embodiment, a system for predicting a remaining useful life (RUL) of a component of an equipment is provided. The system includes a data acquisition (DAQ) unit, a feature capturing unit, a mapping function generating unit, a similarity analyzing unit and a RUL calculating unit. The DAQ unit is for obtaining a real time sensing record. The feature capturing unit is for obtaining an estimation feature according to the real time sensing record, and obtaining a plurality of training features according to a plurality of history sensing records. The mapping function generating unit is for obtaining a mapping function according to the training features. The mapping function includes a relationship between the training features and at least one predicting value. The similarity analyzing unit is for obtaining k similar features which are similar to the estimation feature according to the training features. The RUL calculating unit is for obtaining the at least one predicting value via the mapping function according to the k similar features and calculating an estimation RUL according to the at least one predicting value.

According to another embodiment, a method for predicting a remaining useful life (RUL) of a component of equipment is provided. The method includes the following steps. A real time sensing record is obtained. An estimation feature is obtained according to the real time sensing record, and a plurality of training features are obtained according to a plurality of history sensing records. A mapping function is obtained according to the training features. The mapping function includes a relationship between the training features and at least one predicting value. k similar features which are similar to the estimation feature are obtained according to the training features. The at least one predicting value is obtained via the mapping function according to the k similar features and an estimation RUL is calculated according to the at least one predicting value.

›BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a sensing curve of a metal organic chemical-vapor deposition (MOCVD) equipment.

FIG. 2 shows a system for predicting a RUL of a component of an equipment.

FIG. 3 shows a flowchart of a method for predicting the RUL of the component of the equipment.

FIG. 4 shows a plurality of history sensing records in two cycles.

FIG. 5 shows at least one basis set.

FIG. 6 shows an off-line system.

FIG. 7 shows an on-line system.

In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the disclosed embodiments. It will be apparent, however, that one or more embodiments may be practiced without these specific details. In other instances, well-known structures and devices are schematically shown in order to simplify the drawing.

›DETAILED DESCRIPTION · 1 of 2

In the present invention, a remaining useful life prediction (RUL prediction) can be performed on a component of an equipment, such as a particle filter of a semiconductor equipment or an LED manufacturing equipment. Please refer to FIG. 1 , which shows a sensing curve of a metal organic chemical-vapor deposition (MOCVD) equipment. In the MOCVD equipment, a curve L 1 presents sensing records, i.e. filter values. If the max value of the sensing records is larger than 30, the particle filter is needed to be replaced. The curve L 2 presents sensing records in one cycle from the beginning of particle filter to the end of the particle filter. The curve L 3 presents the max value of the sensing records in each run.

The RUL prediction of the particle filter of the MOCVD is for predicting a time when the max value of the sensor records will be larger than 30. The following embodiment is illustrated by the curve L 3 .

Please refer to FIG. 2 which shows a system 100 for predicting the RUL of the component of the equipment, and FIG. 3 which shows a flowchart of a method for predicting the RUL of the component of the equipment. The system for predicting the RUL of the component of the equipment includes a database 110 , a mapping function generating unit 120 , a data acquisition unit (DAQ unit) 130 , a feature capturing unit 140 , a similarity analyzing unit 150 and a RUL calculating unit 160 . The database 110 for storing varied kinds of data can be a hard disk, a memory, a portable storage device or a storage could center. The mapping function generating unit 120 is for generating a function according to some data. The DAQ unit 130 is for capturing some data. The feature capturing unit 140 is for capturing feature according to some data. The feature capturing unit 140 includes a dictionary training machine 141 and a sparse coder 142 . The similarity analyzing unit 150 is for performing a similarity comparison algorithm. The RUL calculating unit 160 is for performing some calculating procedure. Each of the mapping function generating unit 120 , the feature capturing unit 140 , the similarity analyzing unit 150 and the RUL calculating unit 160 can be a circuit, a package chip, a circuit board or a storage device storing a plurality of codes. The DAQ unit 130 can be a sensor, a transmitting line or a wireless transmitting device.

Firstly, in step S 301 , a plurality of history sensing records X 1 , X 2 , . . . , Xi+1, Xi+2, etc. are obtained from the database 110 . Please refer to FIG. 4 , which shows history sensing records X 1 , X 2 , X 3 , etc. in a cycle C 1 and history sensing records Xi+1, Xi+2, etc. in a cycle C 2 . Every four runs are grouped and one history sensing record in this group is recorded. The history sensing records X 1 , X 2 , X 3 , . . . , Xi+1, Xi+2, etc. are mapped to a plurality of training RULs RUL 1 , RUL 2 , RUL 3 , . . . , RULi+1, RULi+2, etc. respectively. Each of the training RULs RUL 1 , RUL 2 , RUL 3 , . . . , RULi+1, RULi+2, etc. can be a remaining number of runs or a remaining life percentage. For example, if a particle filter is replaced at the 19th run in a cycle, the remaining number of runs is 14 and the remaining life percentage is 73.6% (= 14/19) at the 5th run.

Next, in step S 302 , by a dictionary learning algorithm, the dictionary training machine 141 of the feature capturing unit 140 generates at least one basis set U 1 (or U 2 , etc.) according to the history sensing records X 1 , X 2 , X 3 , . . . , Xi+1, Xi+2, etc. For example, the dictionary learning algorithm can be a K-SVD algorithm or an online dictionary learning algorithm. Please refer to FIG. 5 , which shows at least one basis set. Each basis set includes four runs. An approximation of any of the history sensing records X 1 , X 2 , X 3 , . . . , Xi+1, Xi+2, etc. can be obtained by linearly combining the at least one basis set.

Then, in step S 303 , the sparse coder 142 of the DAQ unit 140 generates a plurality of training features a 1 , a 2 , . . . , ai+1, ai+2, etc. according to the history sensing records X 1 , X 2 , X 3 , . . . , Xi+1, Xi+2, etc. by a sparse coding algorithm. The sparse coding algorithm can be a match pursuit algorithm, an orthogonal matching pursuit algorithm or a Lasso algorithm. Each of the history sensing records X 1 , X 2 , X 3 , . . . , Xi+1, Xi+2, etc. is a linear combination of one of the training features a 1 , a 2 , . . . , ai+1, ai+2, etc. and the basis sets U 1 , U 2 , etc. For example, the training feature a 1 is a matrix [0, 0.5, 1, 0, 0, 1, . . . ], and the history sensing record X 1 is a linear combination of the training feature a 1 and the basis sets U 1 , U 2 , etc. The training feature a 2 is a matrix [0, 0, 1.5, 0, 0, 1, . . . ], and the history sensing record X 2 is a linear combination of the training feature a 2 and the basis sets U 1 , U 2 , etc.

Afterwards, in step S 304 , the mapping function generating unit 120 obtains a mapping function according to the training features a 1 , a 2 , . . . , ai+1, ai+2, etc. The mapping function includes a relationship between the training features a 1 , a 2 , . . . , ai+1, ai+2, etc. and at least one predicting value. The at least one predicting value includes the training RULs RUL 1 , RUL 2 , RUL 3 , . . . , RULi+1, RULi+2, etc. and cycle identifications which represent as cycles C 1 , C 2 , etc. For example, the training feature a 1 is mapped to a training RUL RULa 1 and a cycle Ca 1 , the training feature a 2 is mapped to a training RUL RULa 2 and a cycle Ca 2 , and so on.

Next, in step S 305 , the DAQ unit 130 obtains a real time sensing record Xt.

Then, in step S 306 , the sparse coder 142 of the feature capturing unit 140 obtains an estimation feature AT according to the real time sensing record Xt.

Next, in step S 307 , the similarity analyzing unit 150 obtains k similar features atop 1 , atop 2 , . . . , atopk which are similar to the estimation feature AT according to the training features a 1 , a 2 , . . . , ai+1, ai+2, etc. by the similarity comparison algorithm. For example, the similarity comparison algorithm can be a k-nearest neighbor algorithm. Please refer to table 1 , which shows the similarities between the estimation feature AT and the training features a 1 , a 2 , . . . , ai+1, ai+2, etc. respectively. After calculating the similarities between the estimation feature AT and the training features a 1 , a 2 , . . . , ai+1, ai+2, etc., the similarities are sorted to find the k similar features atop 1 , atop 2 , . . . , atopk.

›DETAILED DESCRIPTION · 2 of 2

Afterwards, in step S 308 , the RUL calculating unit 160 obtains the at least one predicting value via the mapping function according to the k similar features atop 1 , atop 2 , . . . , atopk. For example, k similar RULs RULatop 1 , RULatop 2 , . . . , RULatopk and k similar cycle Catop 1 , Catop 2 , . . . , Catopk mapping to the similar features atop 1 , atop 2 , atopk are obtained.

Then, in step S 309 , the RUL calculating unit 160 calculates an estimation RUL RULt according to the at least one predicting value, such as the similar RULs RULatop 1 , RULatop 2 , . . . , RULatopk. In this step, the RUL calculating unit 160 calculates the estimation RUL RULt by a weighted average calculation on the similar RULs RULatop 1 , RULatop 2 , . . . , RULatopk. In one embodiment, a weighting in the weighted average calculation is directly proportional or inversely proportional to the at least one predicting value. For example, the weighting factors of the similar RUL RULatop 1 , RULatop 2 , . . . , RULatopk are proportional to the repeat times of each of the similar cycles Catop 1 , Catop 2 , . . . , Catopk. For example, please refer to table 2 , which shows three similar RULs RULatop 1 , RULatop 2 , RULatop 3 and three similar cycles Catop 1 , Catop 2 , Catop 3 .

Both of the similar cycle Catop 1 and the similar cycle Catop 2 are the 13th cycle. The 13th cycle is repeated twice, so each of the weighting factors of the similar RULs RULatop 1 , RULatop 2 should be twice as large as the weighting factor of the similar RUL RULatop 3 . The estimation RUL RULt can be calculated according to the following equation (1).

RULt= ⅖(—⅖(13)+⅕(17)=15.8  (1)

Next, in step S 310 , the RUL calculating unit 160 further calculates an estimation confidence CF which is related to a variability of the at least one predicting value, such as a variability of the similar RULs RULatop 1 , RULatop 2 , . . . , RULatopk. If the variability of the similar RULs RULatop 1 , RULatop 2 , . . . , RULatopk is high, then the estimation confidence CF is low. Taken the table 2 as an example, the estimation confidence CF can be calculated according to the following equation (2).

Then, in step S 311 , the RUL calculating unit 160 adjusts the estimation RUL RULt to be an estimation RUL RULt′ according to the estimation confidence CF. For example, please refer to table 3 , which shows the estimation RULs RULt at the previous time and the current time. Because the estimation confidence CF at the previous time is higher than the estimation confidence CF at the current time, the estimation RULt (=15.8) at the previous time is subtracted 1 to be the estimation RUL RULt′ (=14.8).

In one embodiment, the system 1000 can be divided into an off-line system 1000 A and an on-line system 1000 B. Please refer to FIG. 6 which shows the off-line system 1000 A, and FIG. 7 which shows the on-line system 1000 B. The off-line system 1000 A used for performing the steps S 301 to S 304 includes the database 110 , the mapping function generating unit 120 and the feature capturing unit 140 . The on-line system 1000 B used for performing the steps S 305 to S 311 includes the mapping function generating unit 120 , the DAQ unit 130 , the feature capturing unit 140 , the similarity analyzing unit 150 and the RUL calculating unit 160 .

According to the embodiments described above, the system 1000 and the off-line system 1000 A can generate the basis sets U 1 , U 2 , etc. according to the history sensing records X 1 , X 2 , X 3 , . . . , Xi+1, Xi+2, etc. Then, the training features a 1 , a 2 , . . . , ai+1, ai+2, etc. are generated according to the history sensing records X 1 , X 2 , X 3 , . . . , Xi+1, Xi+2, etc. Next, the mapping function is obtained according to the training features a 1 , a 2 , . . . , ai+1, ai+2, etc. For example, the training feature a 1 is mapped to the training RUL RULa 1 and the cycle Ca 1 , the training feature a 2 is mapped to the training RUL RULa 2 and the cycle Ca 2 , and so on.

The system 1000 and the on-line system 1000 B can obtain the estimation feature AT according to the real time sensing record Xt, and obtain the k similar features atop 1 , atop 2 , . . . , atopk which are similar to the estimation feature AT. Next, the estimation RUL RULt is calculated by a weighted average calculation on the similar RULs RULatop 1 , RULatop 2 , . . . , RULatopk, and the estimation confidence CF is calculated. Finally, the estimation RUL RULt is adjusted according to the estimation confidence CF.

It will be apparent to those skilled in the art that various modifications and variations can be made to the disclosed embodiments. It is intended that the specification and examples be considered as exemplary only, with a true scope of the disclosure being indicated by the following claims and their equivalents.

›Tables in the description — 3
TABLE 1
Comparisonsimilarity
estimation feature AT and training feature a10.569
estimation feature AT and training feature a20.301
estimation feature AT and training feature a30.0301
. . .. . .
TABLE 2
similar RULsimilar cycle
The value of the similar RULThe similar cycle Catop1
RULatop1 is “18.”is the 13th cycle.
The value of the similar RULThe similar cycle Catop2
RULatop2 is “13.”is the 13th cycle.
The value of the similar RULThe similar cycle Catop3
RULatop3 is “17.”is the first cycle.
TABLE 3
previous timecurrent timeAdjust
estimation RUL15.812.614.8
RULt
estimation0.2120.1980.212
confidence CF
1 of 7 part labels are ours — the grant heads the rest

Claims as granted

21 claims

Log in to read the claims of this application.

Log in to unlock

Classifications

4 codes
IPC · International Patent Classification
Section G — Physics
  • G05B23/02
  • G06N5/04
  • G06N7/00
  • G06N20/00

Claim changes

Soon
Coming soonHow the claims changed between publication and grant

See which claims were amended, added or cancelled during examination, with every added and removed word marked.

AmendedAddedCancelledUnchanged

The published claims of this application are not paired with the granted ones in what we hold.

File wrapper

⤢ drag to zoomJul 2016Oct 2016Jan 2017Apr 2017Jul 2017Oct 2017Jan 2018Apr 2018Jul 2018Oct 2018Jan 2019Apr 2019USPTOApplicantNon-final rejectionResponse after non-finalFinal rejectionResponse after final
USPTOApplicanthover for detail · click to open
Pendency
2.7 y
972 days filing → grant
Office actions
2
non-final + final
Responses
2
no RCE
Examiner
David M. Gray
art unit 2852 · TC 2800
Citations: 36 back · 1 forward

See the full prosecution history — every USPTO and applicant action on this file, in order.

Log in to unlock

Documents

Log in to open the documents of this file: the application as filed, every office action and response, the notice of allowance.

Log in to unlock

Chain of title

⤢ drag to zoom20162018202020222024202620282030203220342036Owner 1
Titlehover for detail · click to open

See the full assignment history — every owner this patent has passed through, with recordation dates and reel/frame numbers.

Log in to unlock