The present invention relates to monitoring machines and physical processes for early detection of impending equipment failure or process disturbance and on-line, continuous validation of sensor operation. More particularly, the invention relates to systems and methods governing adaptation of empirical models to changed conditions in such monitoring systems, and resolution of process change from sensor change.
A variety of new and advanced techniques have emerged in industrial process control, machine control, system surveillance, and condition based monitoring to address drawbacks of traditional sensor-threshold-based control and alarms. The traditional techniques did little more than provide responses to gross changes in individual metrics of a process or machine, often failing to provide adequate warning to prevent unexpected shutdowns, equipment damage, loss of product quality or catastrophic safety hazards.
According to one branch of the new techniques, empirical models of the monitored process or machine are used in failure detection and control. Such models effectively leverage an aggregate view of surveillance sensor data to achieve much earlier incipient failure detection and finer process control. By modeling the many sensors on a process or machine simultaneously and in view of one another, the surveillance system can provide more information about how each sensor (and its measured parameter) ought to be behaving. An example of such an empirical surveillance system is described in U.S. Pat. No. 5,764,509 to Gross et al., the teachings of which are incorporated herein by reference. Therein is described an empirical model using a similarity operator against a reference library of known states of the monitored process, and an estimation engine for generating estimates of current process states based on the similarity operation, coupled with a sensitive statistical hypothesis test to determine if the current process state is a normal or abnormal state. Other empirical model-based monitoring systems known in the art employ neural networks to model the process or machine being monitored.
Such empirical model-based monitoring systems require as part of installation and implementation some baseline data characterizing the normal operation of the process or machine under surveillance. The empirical model embodies this baseline normal operational data, and is only as good as the data represents normal operation. A big challenge to the success of the empirical model in the monitoring system, therefore, is to provide sufficiently representative data when building the empirical model. In practice, this is possibly the greatest hurdle for successful implementation of empirical model-based surveillance systems.
A first problem is whether to use data from merely a like process or the identical process with the one being monitored. This is especially significant when monitoring a commodity machine, that is, a machine that will be mass-produced with on-board condition monitoring. Under such circumstances, it may not be possible or practical to gather normal operational data from each machine to build unique empirical models beforehand. What is needed is a way of building a general model into the newly minted machines, and allowing the model to adapt to the unique tolerances and behavior of each particular machine in the field.
A second problem presents itself as the monitored process or machine settles with age, drifting from the original normal baseline, but still being in good operational condition. It is extremely difficult to capture such eventually normal operational data from a process or machine for which that would currently not constitute normal operation. What is then needed is a way for the empirical model to adapt to acceptable changes in the normal operation of the process or machine with age, without sacrificing the monitoring sensitivity that necessitated the empirical model approach in the first place.
A third problem exists where it is not possible to capture the full normal operational range of sensor data from the process due to the financial or productive value of not disrupting the process. For example, in retrofitting an existing industrial process with empirical model-based monitoring, it may not be economically feasible to effectively take the process off-line and run it through its many operational modes. And it may be months or years before all the operational modes are employed. Therefore, what is needed is a way to adapt the empirical model as the operational modes of the process or machine are encountered for the first time.
In summary, in order for an empirical model based process surveillance system to function reliably, the data used to generate the model should span the full process operating range. In many cases that data are not available initially. Therefore, model adaptation is needed to keep the model up-to-date and valid. But adaptation imposes significant hurdles of its own. One such hurdle is determining exactly when to start adapting the model, especially for dynamic non-linear processes. While in some cases human intervention can be relied upon to manually indicate when to adapt, in the vast majority of circumstances it is desirable to automate this determination. Another such hurdle is determining when to stop adapting the model and reinitiate process or machine surveillance. Yet another problem is to distinguish the need for adaptation from a process upset or a sensor failure that should be properly alarmed on. It is highly desirable to avoid “bootstrapping” on a slow drift fault in the process, for example. Yet another problem is to avoid adapting during a period of transition between one stable state and another, during which sensor data may not be typically representative of either any old state or a new state of normal operation of the process or machine. Yet another problem in adapting the empirical model is that the model may grow and become less accurate or less specific due to the addition of new states. Therefore, it would be beneficial to have a way of removing least commonly encountered states from the model while adding the newly adapted states.
The present invention provides an improved empirical model-based system for process or machine control and condition-based monitoring.
This invention is a method and apparatus for deciding when an empirical model of a process or machine should be adapted to encompass changing states in that process or machine, as measured by sensors, derived variables, statistical measures or the like. The technique is based on the information provided by a similarity measurement technology and statistical decisioning tools. This system has a second characteristic in that it determines when to stop the model adaptation process. This system has a third capability of distinguishing between process change and instrument change cases.
In a process or machine that is fully instrumented with sensors for all parameters of interest, sensor data is collected for all regimes possible of expected later operation of the same or similar processes or machines. This collected data forms a history from which the inventive system can “learn” the desired or normal operation of the process or machine, using training routines that distill it to a representative set of sensor data. Using this representative training set of sensor data, the present invention is able to monitor the process or machine in real-time operation (or in batch mode, if preferred), and generate estimates for all the sensors, including certain of the sensors for which historic data was collected, but which have failed or which were removed from the process or machine. The present invention can be employed as a means of adapting the representative set of sensor data to accommodate changes to the monitored system that are considered within the acceptable or normal range of operation.
The apparatus of the present invention can be deployed as an electrically powered device with memory and a processor, physically located on or near the monitored process or machine. Alternatively, it can be located remotely from the process or machine, as a module in a computer receiving sensor data from live sensors on the process or machine via a network or wireless transmission facility.
The novel features believed characteristic of the invention are set forth in the appended claims. The invention itself, however, as well as the preferred mode of use, further objectives and advantages thereof, is best understood by reference to the following detailed description of the embodiments in conjunction with the accompanying drawings, wherein:
Turning to
In standard monitoring mode, the sensor data from input bus 108 are also provided to a differencing engine 120 that is disposed to receive estimates of the current state generated by the empirical model 117 in response to input of the actual current state of the process or machine. The differencing engine subtracts for each sensor involved the estimate from the actual, and provides these individual outputs to a statistical testing module 122 that determines whether the estimate and actual values are the same or statistically different, in which case an alert is displayed or otherwise provided to further automated control systems. By way of example, the statistical testing module 122 can be disposed to perform a sequential probability ratio test (SPRT) on each of the differenced sensor signals coming from differencing engine 120, to provide alerts for each signal that is not “normal” or acceptable. In this manner, monitoring of the process or machine is carried out based on the empirical model, providing greater sensitivity and improved lead warning time for failures.
Current sensor data can also be provided to adaptation decision module 125. According to the present invention, this module makes a determination of whether the current snapshot of sensor data from the process or machine 105 represents a process upset or a sensor failure, or in contrast represents the start of a transition to a new operational state requiring adaptation of the model, or the stop of a transition to a new operational state. Upon recognizing the start of such a transition, the alert-type output of the empirical model-based monitoring can be temporarily suspended to avoid inundating a human operator or a downstream control system with unnecessary alert information. Upon recognizing the stop of the transition, the adaptation decision module 125 can enable a retraining module 128 disposed to carry out the actual changes to the reference library 114 necessary to effect adaptation of the model. After the stop of the transition, the process or machine 105 is expected to be in a stabilized new state that may not be represented in the reference library 114. After the transition is complete, the adaptation decision module 125 initiates via the retraining module 128 capture of new snapshots of live data to augment the reference library 114. In the event that the reference library grows too large, or is desirably maintained at a certain size (e.g., for performance considerations), the vector removal module 131 can weed out old snapshots from the reference library according to certain criteria. Upon completion of the adaptation of the reference library, on-line monitoring is commenced again.
The invention provides a fully automated model adaptation decision-making technique for condition based monitoring of a machine or process. The adaptation decision module can employ the same similarity operator techniques that can be employed in the empirical model for generating estimates, as discussed below. Accordingly, the current sensor snapshot from the input bus 108 is compared using the similarity operator to the estimate generated in response thereto by the estimation engine 111 to generate a similarity score called global similarity for purposes hereof. This global similarity is itself a signal that can be monitored and processed snapshot over snapshot. The behavior of the global similarity is one means by which the inventive module can distinguish the need for adaptation from a mere process or sensor upset.
Turning now first to the regular monitoring mode of the inventive surveillance system, an empirical model-based method and system for monitoring a process or machine is described in the aforementioned U.S. Pat. No. 5,764,509 to Gross et al. Implementing such a monitoring system comprises two stages, a first stage for building the empirical model (also known as “training”), and a second stage of turning live monitoring on. Other empirical models that train on known data could also be employed, such as neural networks, but for purposes of illustration, an empirical model along the lines of the Gross patent as a baseline will be described.
A method for training the empirical model is graphically depicted in
Selection of representative data is further depicted in
In step 307, if the sensor value of sensor i at snapshot t in X is greater than the maximum yet seen for that sensor in the collected data, max(i) is update to equal the sensor value and Tmax(i) stores the number t of the observation in step 310. If not, a similar test is done for the minimum for that sensor in steps 314 and 317. The observation counter t is incremented in step 320. In step 322, if all the observations have been reviewed for a given sensor (t=L), then t is reset and i is incremented (to find the maximum and minimum for the next sensor) in step 325. If the last sensor has been finished (i=N), step 328, then redundancies are removed and an array D is created from a subset of vectors from X.
First, in step 330, counters i and j are initialized to one. In step 333, the arrays Tmax and Tmin are concatenated to form a single vector Ttmp having 2N elements. These elements are sorted into ascending (or descending) order in step 336 to form array T. In step 339, holder tmp is set to the first value in T (an observation number that contains a sensor minimum or maximum). The first column of D is set equal to the column of X corresponding to the observation number that is the first element of T. In the loop starting with decision step 341, the ith element of T is compared to the value of tmp that contains the previous element of T. If they are equal (the corresponding observation vector is a minimum or maximum for more than one sensor), it has already been included in D and need not be included again. Counter i is incremented in step 350. If they are not equal, D is updated to include the column from X that corresponds to the observation number of T(i) in step 344, and tmp is updated with the value at T(i). The counter j is then incremented in step 347. In step 352, if all the elements of T have been checked, then the distillation into training set D has finished, step 355.
A variety of empirical models are considered to be the object of the present adaptive decisioning and retraining invention, including neural networks, fuzzy logic models, and the like. All these empirical models employ data from the process or machine under surveillance to model and thereby monitor the process or machine. All are subject to the shortcomings of the historic data provided when the models are built, in view of the graceful aging, settling or previously unencountered states of the monitored process or machine. By way of an example of applying the methods of the current invention, the empirical modeling technique of the aforementioned patent to Gross et al., will be described. This empirical modeling technique uses a similarity operator, which is also an inventively employed in the present invention in the form of global similarity and other adaptation decisioning techniques described herein. Generally, a similarity operation provides a scalar similarity score scaled between one extreme (typically “1” for “identical”) and another extreme (typically “zero” for “completely dissimilar”), upon a comparison of two numbers. More particularly, this can be utilized for comparing two vectors having equal numbers of elements, where a similarity score is yielded for comparing each like element of the two vectors, and then averaging or otherwise statistically combining the similarity scores into one vector-to-vector similarity score.
The calculations for the similarity operation are now described in detail below. In what follows, the subscript “in” generally corresponds to the actual snapshot obtained from the input bus 108, which may comprise for example ten real time correlated sensors, and the subscript “out” generally corresponds to estimates generated by the estimation engine 111. The reference library 114 comprises a series of snapshots selected according to the above-described training method, each snapshot being a vector of sensor data, arranged like the input snapshot is arranged. To follow the example then, the reference library would comprise vectors made up of ten elements each. This reference library will also be referred to as the matrix D.
The step of providing a representative training set according to the description above results in a matrix D of values, having ten rows (corresponding to the ten parameters measured on the process or machine) and a sufficient number n of columns (sets of simultaneous or temporally related sensor readings) to properly represent the full expected dynamic operating range of the process or machine. While the order of the columns does not matter in D, the correspondence of rows to particular sensors must be fixed.
Then, using yin to designate a vector (having ten elements in this example) corresponding to the input snapshot from input bus 108, a vector yout is generated as the estimate from estimation engine 111 having ten elements, according to:
{right arrow over (y)}out=
where W is a weight vector having as many elements N as there are columns in D, generated by:
where the similarity operation is represented by the circle with the cross-hatch inside it. The superscript “T” here represents the transpose of the matrix, and the superscript “−1” represents the inverse of the matrix or resulting array. Importantly, there must be row correspondence to same sensors for the rows in D, yin and yout. That is, if the first row of the representative training set matrix D corresponds to values for a first sensor on the machine, the first element of yin must also be the current value (if operating in real-time) of that same first sensor.
The similarity operation can be selected from a variety of known operators that produce a measure of the similarity or numerical closeness of rows of the first operand to columns of the second operand. The result of the operation is a matrix wherein the element of the ith row and jth column is determined from the ith row of the first operand and the jth column of the second operand. The resulting element (i,j) is a measure of the sameness of these two vectors. In the present invention, the ith row of the first operand generally has elements corresponding to sensor values for a given temporally related state of the process or machine, and the same is true for the jth column of the second operand. Effectively, the resulting array of similarity measurements represents the similarity of each state vector in one operand to each state vector in the other operand.
By way of example, one similarity operator that can be used compares the two vectors (the ith row and jth column) on an element-by-element basis. Only corresponding elements are compared, e.g., element (i,m) with element (m,j) but not element (i,m) with element (n,j). For each such comparison, the similarity is equal to the absolute value of the smaller of the two values divided by the larger of the two values. Hence, if the values are identical, the similarity is equal to one, and if the values are grossly unequal, the similarity approaches zero. When all the elemental similarities are computed, the overall similarity of the two vectors is equal to the average of the elemental similarities. A different statistical combination of the elemental similarities can also be used in place of averaging, e.g., median.
Another example of a similarity operator that can be used can be understood with reference to
Any angle size less than 180 degrees and any location for the angle above the base 407 can be selected for purposes of creating a similarity domain, but whatever is chosen must be used for all similarity measurements corresponding to that particular sensor and physical parameter of the process or machine. Conversely, differently shaped triangles 404 can be used for different sensors. One method of selecting the overall shape of the triangle is to empirically test what shape results in consistently most accurate estimated signal results.
For computational efficiency, angle Ω can be made a right angle (not depicted in the figure). Designating line segment 431 as a height h of the angle Ω above the base 407, then angle θ for a given element-to-element similarity for element i is given by:
Then, the elemental similarity is:
As indicated above, the elemental similarities can be statistically averaged or otherwise statistically treated to generate an overall similarity of a snapshot to another snapshot, as if called for according to the invention.
Yet another class of similarity operator that can be used in the present invention involves describing the proximity of one state vector to another state vector in n-space, where n is the dimensionality of the state vector of the current snapshot of the monitored process or machine. If the proximity is comparatively close, the similarity of the two state vectors is high, whereas if the proximity is distant or large, the similarity diminishes, ultimately vanishingly. By way of example, Euclidean distance between two state vectors can be used to determine similarity. In a process instrumented with 20 sensors for example, the Euclidean distance in 20-dimensional space between the currently monitored snapshot, comprising a 20 element state vector, and each state vector in the training set provides a measure of similarity, as shown:
wherein X is the current snapshot, and d is a state vector from the training set, and λ and c are user-selectable constants.
Turning now to the adaptive systems and methods of the present invention, adaptation decision module 125 generally performs tests on the current snapshot of sensor data or a sequence of these, to determine whether or not to adapt to a new operational state of the process or machine. This determination has inherent in it several more particular decisions. First, the adaptation decision module must decide whether or not the entire monitoring apparatus has just initiated monitoring or not. If monitoring has just started, the adaptation decision module will wait for several snapshots or samples of data for the monitoring to stabilize before making tests to decide to adapt. A second decision related to the overall decision to adapt pertains to whether or not the monitored process or machine has entered a transition or not. Typically, when a process or machine changes states, whether through process upset, machine failure, or merely a change in normal operation, there is a period of time during which the monitored sensors provide dynamic data, and the process or machine is neither stably in its old mode nor yet stably in its new target mode. This transition is usually manifested as a transient swing in one or more of the sensor data. The adaptation decision module waits for the transition to complete before adapting. Therefore, in addition to the second decision of determining when a transition has begun, a third decision that must be made is whether the transition period is over, and the monitored process or machine is in a new stable operational state. It should be understood that “stable” does not mean a state in which all sensor readings are flat, but rather a state that can be reliably recognized by the empirical model, which may entail dynamic but nonetheless correlated movement of sensor readings. A fourth decision that must be made after a transition is to determine if the new stable operational state is one that has not been seen by the empirical model or not. If it has not before been encountered, it is a candidate for adaptation. Finally, a fifth decision that must be made is whether a new, previously unencountered state is in fact a new acceptable state, or a process or sensor upset.
According to the invention, detection of a transient as evidence of a possible transition out of the current operational state can be performed using the global similarity operator. The global similarity is the vector-to-vector similarity score computed from a comparison of the current snapshot from the input bus 108 against the estimate from the estimation engine 111. Typically, the estimate is the estimate generated in response to the current snapshot, but it is also within the scope of the present invention that it can be an estimate generated from a prior snapshot, such as when the model generates predictive estimates for sensor values. The calculations for generating a vector-to-vector similarity value have already been outlined above. Turning to
Generally, when a process or machine is operating in a state that is recognized by the empirical model, the global similarity between the estimate and the current input are high, close to 1, and do not vary much. The location of the limits 506 and 509 can be user-selected, or can be automatically selected. One method for automatically selecting these limits is to collect a series of successive global similarities and determine the mean of them and the standard deviation. The limits are then set at the mean plus or minus a multiple of the standard deviation. A preferred multiple is 3 times the standard deviation. The number of successive global similarities used can be any statistically significant number over which the process or machine is in a modeled operational state, and 100–1000 is a reasonable number. A smaller number may be reasonable if the sampling rate for monitoring is lower, and in some cases can be in the range of 5–10 where the sampling rate for monitoring is on the order of single digits for the time period in which the monitored system or process can substantially deviate from normal operation.
Yet another way of computing the limits 506 and 509 is as follows. After accumulating a historic data set from which a reference library is selected according to a training method like the Min-Max method described with reference to
According to yet another way of defining limits 506 and 509, they are not straight line limits, but instead limits that float a fixed amount on either side of a mean determined over a moving window of global similarities. For example, the standard deviation may be computed according to either way described above, and then a multiple of the standard deviation selected. This is then set around a mean this is defined as the mean global similarity of the last several snapshots, for example the last five or the last ten.
When a global similarity at a snapshot 516 travels outside the limits 506 or 509, the adaptation decision module recognizes this as a transient. This signifies a likelihood that a transition of the monitored process or machine is starting. The adaptation decision module can turn off monitoring, or at least alert generation from statistical testing module 122 upon detection of a transient. Further, the adaptation decision module then begins to employ one or more of several tests that can be used to determine when a transition period ends.
Preferably, upon first detecting the transient, the adaptation decision module places upper limit 506 and lower limit 509 around each subsequent global similarity point, using the point as the mean, but still using the selected multiple of the prior established standard deviation as the limits. Each successive point is compared to these limits as set around the “mean” of the last point location. This can be seen in
When a count is reached of in-range global similarity points, as for example at point 623 after five consecutive in-range points indicated by box 625, the adaptation decision module indicates the transition is over and a new state has been reached. Note in
According to yet another way for determining adaptation, independent of the use of the global similarity, the adaptation decision module can examine certain of the sensor data that comprise the current snapshot that are designated by the user usually upon installation as control variables in the monitored process or machine. This technique provides a much simpler way of determining when to adapt, but can only be employed when control variables are clearly separable from dependent parameters of the process or machine. A control variable is typically manually determined ahead of model building with domain knowledge of the application. Control variables are typically those inputs to a process or machine that drive the operational behavior of the process or machine. They are often environmental variables over which no control can be exerted. For example, in an engine or turbine, ambient temperature is often a control variable. When training the empirical model, as for example outlined above with the Min-Max method, the software for executing the inventive adaptive monitoring system keeps track of the overall ranges of the control variables seen in the training set from which the reference set is distilled. Then, in monitoring operation, the adaptive decision module simply compares the current control variable(s) to those ranges, and if one or more control variables are now outside the range trained on, the adaptation decision module can initiate retraining. It is also useful to use control variables alongside the global similarity operator, so that a determination can be made when the transition from one state to another is over, as described above. Alternatively, standard techniques known in the art for analyzing the stability of variables can also be employed directly against the control variables, if the dynamics of the control variables permits, to make the determination of when a transition begins and ends. In any case, in using control variables to determine when to retrain the empirical model, what is sacrificed is the ability to monitor those control variables for upset. In other words, if a control variable goes outside the range that was trained on, it is assumed by the inventive apparatus that a new acceptable operational state has been encountered, rather than assuming that the control variable indicates abnormal operation.
In the event that this control variable-based decision is not employed, there remains after determining that a transition has stopped, the step of determining whether the new state is also already sufficiently modeled, or is a heretofore-unencountered state that must be adapted to. For this the adaptation decision module has a battery of tests that can be used to make the determination in addition to the control variable range check.
In a first technique, a threshold may be applied to the mean global similarity of the new state at the end of the transition period. For example, with reference to
According to a second technique, a window of successive global similarity values can be compared to the selected threshold, and if at least a certain number of these falls below the threshold, then the new state is considered to be unrecognized and potentially subject to adaptation. For example, if a moving window of five global similarities are examined, and at least three are below the threshold, the new state can be deemed subject to adaptation.
In a third technique depicted in
Yet a third technique that may be employed to determine if a new state presents itself and the empirical model must be adapted is to examine the alarm fraction generated by a SPRT module on the monitoring apparatus.
According to the invention, the global similarity operator has the inherent ability to distinguish between a process or sensor upset and a change of state. When a sensor fails, the empirical model typically estimates a reasonable value for what the sensor ought to indicate, based on the other input sensors. The difference between this failed sensor reading and the estimate for it (really an estimate of the underlying measured parameter) provides a means for statistical testing module 122 to alert a human operator that there is a problem at the failed sensor. However, due to the nature of the similarity operation, the effect on the global similarity is limited. In fact, the mean of several sequential global similarities in the case of a failed sensor may not change much from the mean when the sensor was not failed, though the variance of the global similarity may increase somewhat (yet usually still remain within the thresholds 506 and 509 indicated in
When a process upset occurs that affects one or only a few of the monitored parameters, the adaptation decision module will similarly not indicate the need to adapt, even though alerts for the upset are occurring in the monitoring apparatus. This is true even where a process upset eventually leads to significant change in all the variables, because the monitoring apparatus of the present invention is designed to catch the earliest possible sign of change and alert on it. Long before the process upset affects all variables, it is likely the human operator would have been notified of the upset.
In addition, a catastrophic process upset usually also fails to exhibit a settling into a new state. Global similarities for a severely upset process not only potentially drop to very low levels (less than 0.50) but also suffer from a continuing large variance. Typically, a process upset will fail to settle into a new stable state with the rapidity that a mere operational mode shift will, and this can be used to distinguish a process upset from a new acceptable operational state. This is best determined empirically based on the application, and a user selectable setting can be provided in the software of the adaptation decision module to designate a period during which a transition must settle into a stable state or otherwise be considered a process upset and turn on alerting again. According to the invention, the adaptation decision module can also measure the variance of the global similarity, and if the variance is still above a certain threshold after a selected timeout period, the transition can be deemed a process upset, and again alerting can be turned back on in the monitoring coming through statistical testing module 122.
After the adaptation decision module has ascertained that:
When adding current snapshots to the reference library, the retrain module first decides which snapshots to select for addition. According to one embodiment, when the adaptation decision module identifies based on the global similarity a sequence of several, e.g., 5 snapshots, for which the global similarity has stabilized, that is a new state, and the new state has been determined to be previously unmodeled, the five snapshots can be used to augment the reference library. In addition, as of the sixth snapshot, the retrain module begins to go into a longer adaptation cycle, checking the snapshots as they come in and testing using the global similarity test whether the newly augmented model is adequately modeling the new snapshots. A threshold can again be determined, for example 0.90, which the newly augmented reference library must surpass in global similarity, for the adaptation to be declared finished. If the threshold is not met, then the retrain module continues to add new snapshots (or at least those snapshots which do not appear to be adequately modeled) as long as the new state is stable and not a new transient (indicating a new stage of transition or perhaps process upset or sensor failure. A set limit to how long a retrain module will continue to engage in the longer adaptation cycle beyond the end of a transition can also optionally be set, so that adaptation does not continue indefinitely. This may apply to a new state which simply cannot be adequately modeled to the global similarity threshold chosen as the cutoff for adaptation.
According to yet another mode, instead of merely adding the additional identified snapshots to the reference library, the entire reference library and the additional snapshots can be combined into a total training set to which a training method such as Min-Max is applied, to distill the new training set into a new reference library.
When the size limit on the reference library is reached, the vector removal module can use several methods to replace or remove old snapshots (or vectors of sensor data) from the reference library. According to a first way, for each snapshot that will be added beyond the limit, the vector in the reference library which bears the highest similarity to the snapshot desirably added is removed. For this operation the similarity operator is used as described herein. According to a second method, upon using a training method such as Min-Max, the time stamp of when a vector is added to the reference library is examined through the entire library, and the oldest time stamped vector is removed. In this case, the replacement snapshot bears the time stamp of the moment of replacement, and therefore has the newest time stamp. According to yet another method, during regular monitoring mode of the empirical model-based monitoring apparatus, for each current snapshot from the monitored process or machine, a determination is made which snapshot in the reference library has the highest similarity to it, and that snapshot is time-stamped with the moment of comparison. Therefore, each snapshot in the reference library is potentially being updated as being the last closest state vector seen in operation of the process or machine. Then, when adding a new vector as part of adaptation, the vector with the oldest time stamp is replaced. The new replacement snapshot of course bears a current time stamp. In this way, snapshots in the reference library representing states the monitoring system has not seen in the longest time, are replaced first with new updated snapshots. This mode is particularly useful when monitoring equipment or processes that settle gracefully with age, and are not expected to achieve exactly the operational states they were in when they were brand new.
It will be appreciated by those skilled in the art that modifications to the foregoing preferred embodiments may be made in various aspects. The present invention is set forth with particularity in any appended claims. It is deemed that the spirit and scope of that invention encompasses such modifications and alterations to the preferred embodiment as would be apparent to one of ordinary skill in the art and familiar with the teachings of the present application.
This application claims benefit of U.S. Provisional Application No. 60/262,747, filed Jan. 19, 2001.
Number | Name | Date | Kind |
---|---|---|---|
3045221 | Roop | Jul 1962 | A |
3561237 | Eggers et al. | Feb 1971 | A |
3767900 | Chao et al. | Oct 1973 | A |
3928022 | Langagne | Dec 1975 | A |
4060716 | Pekrul et al. | Nov 1977 | A |
4215412 | Bernier et al. | Jul 1980 | A |
4336595 | Adams et al. | Jun 1982 | A |
4368510 | Anderson | Jan 1983 | A |
RE31750 | Morrow | Nov 1984 | E |
4480480 | Scott et al. | Nov 1984 | A |
4639882 | Keats | Jan 1987 | A |
4707796 | Calabro et al. | Nov 1987 | A |
4761748 | Le Rat et al. | Aug 1988 | A |
4773021 | Harris et al. | Sep 1988 | A |
4823290 | Fasack et al. | Apr 1989 | A |
4937763 | Mott | Jun 1990 | A |
4975827 | Yonezawa | Dec 1990 | A |
4985857 | Bajpai et al. | Jan 1991 | A |
5025499 | Inoue et al. | Jun 1991 | A |
5052630 | Hinsey et al. | Oct 1991 | A |
5088058 | Salsburg | Feb 1992 | A |
5113483 | Keeler et al. | May 1992 | A |
5119287 | Nakamura et al. | Jun 1992 | A |
5123017 | Simpkins et al. | Jun 1992 | A |
5166873 | Takatsu et al. | Nov 1992 | A |
5195046 | Gerardi et al. | Mar 1993 | A |
5210704 | Husseiny | May 1993 | A |
5223207 | Gross et al. | Jun 1993 | A |
5251285 | Inoue et al. | Oct 1993 | A |
5285494 | Sprecher et al. | Feb 1994 | A |
5309351 | McCain et al. | May 1994 | A |
5309379 | Rawlings et al. | May 1994 | A |
5311562 | Palusamy et al. | May 1994 | A |
5325304 | Aoki | Jun 1994 | A |
5327349 | Hoste | Jul 1994 | A |
5386373 | Keeler et al. | Jan 1995 | A |
5402333 | Cardner | Mar 1995 | A |
5414619 | Katayama et al. | May 1995 | A |
5414632 | Mochizuki et al. | May 1995 | A |
5420571 | Coleman et al. | May 1995 | A |
5421204 | Svaty, Jr. | Jun 1995 | A |
5445347 | Ng | Aug 1995 | A |
5446671 | Weaver et al. | Aug 1995 | A |
5446672 | Boldys | Aug 1995 | A |
5455777 | Fujiyama et al. | Oct 1995 | A |
5459675 | Gross et al. | Oct 1995 | A |
5481647 | Brody et al. | Jan 1996 | A |
5486997 | Reismiller et al. | Jan 1996 | A |
5500940 | Skeie | Mar 1996 | A |
5502543 | Aboujaoude | Mar 1996 | A |
5539638 | Keeler et al. | Jul 1996 | A |
5548528 | Keeler et al. | Aug 1996 | A |
5553239 | Heath et al. | Sep 1996 | A |
5559710 | Shahraray et al. | Sep 1996 | A |
5566092 | Wang et al. | Oct 1996 | A |
5586066 | White et al. | Dec 1996 | A |
5596507 | Jones et al. | Jan 1997 | A |
5600726 | Morgan et al. | Feb 1997 | A |
5602733 | Rogers et al. | Feb 1997 | A |
5608845 | Ohtsuka et al. | Mar 1997 | A |
5612886 | Weng | Mar 1997 | A |
5617342 | Elazouni | Apr 1997 | A |
5623109 | Uchida et al. | Apr 1997 | A |
5629878 | Kobrosly | May 1997 | A |
5638413 | Uematsu et al. | Jun 1997 | A |
5644463 | El-Sharkawi et al. | Jul 1997 | A |
5657245 | Hecht et al. | Aug 1997 | A |
5663894 | Seth et al. | Sep 1997 | A |
5668944 | Berry | Sep 1997 | A |
5671635 | Nadeau et al. | Sep 1997 | A |
5680409 | Qin et al. | Oct 1997 | A |
5680541 | Kurosu et al. | Oct 1997 | A |
5682317 | Keeler et al. | Oct 1997 | A |
5708780 | Levergood et al. | Jan 1998 | A |
5710723 | Hoth et al. | Jan 1998 | A |
5727144 | Brady et al. | Mar 1998 | A |
5737228 | Ishizuka et al. | Apr 1998 | A |
5748469 | Pyotsia | May 1998 | A |
5748496 | Takahashi et al. | May 1998 | A |
5751580 | Chi | May 1998 | A |
5754451 | Williams | May 1998 | A |
5761090 | Gross et al. | Jun 1998 | A |
5764509 | Gross et al. | Jun 1998 | A |
5774379 | Gross et al. | Jun 1998 | A |
5787138 | Ocieczek et al. | Jul 1998 | A |
5817958 | Uchida et al. | Oct 1998 | A |
5818716 | Chin et al. | Oct 1998 | A |
5822212 | Tanaka et al. | Oct 1998 | A |
5841677 | Yang et al. | Nov 1998 | A |
5842157 | Wehhofer et al. | Nov 1998 | A |
5864773 | Barna et al. | Jan 1999 | A |
5895177 | Iwai et al. | Apr 1999 | A |
5905989 | Biggs | May 1999 | A |
5909368 | Nixon et al. | Jun 1999 | A |
5913911 | Beck et al. | Jun 1999 | A |
5930156 | Kennedy | Jul 1999 | A |
5930779 | Knoblock et al. | Jul 1999 | A |
5933352 | Salut | Aug 1999 | A |
5933818 | Kasravi et al. | Aug 1999 | A |
5940298 | Pan et al. | Aug 1999 | A |
5946661 | Rothschild et al. | Aug 1999 | A |
5946662 | Ettl et al. | Aug 1999 | A |
5949678 | Wold et al. | Sep 1999 | A |
5950147 | Sarangapani et al. | Sep 1999 | A |
5956487 | Venkatraman et al. | Sep 1999 | A |
5961560 | Kemner | Oct 1999 | A |
5987399 | Wegerich et al. | Nov 1999 | A |
5993041 | Toba | Nov 1999 | A |
6006192 | Cheng et al. | Dec 1999 | A |
6006260 | Barrick et al. | Dec 1999 | A |
6021396 | Ramaswamy et al. | Feb 2000 | A |
6029097 | Branicky et al. | Feb 2000 | A |
6049738 | Kayama et al. | Apr 2000 | A |
6049741 | Kawamura | Apr 2000 | A |
6049827 | Sugauchi et al. | Apr 2000 | A |
6064916 | Yoon | May 2000 | A |
6088626 | Lilly et al. | Jul 2000 | A |
6104965 | Lim et al. | Aug 2000 | A |
6110214 | Klimasauskas | Aug 2000 | A |
6115653 | Bergstrom et al. | Sep 2000 | A |
6125351 | Kauffman | Sep 2000 | A |
6128540 | Van Der Vegt et al. | Oct 2000 | A |
6128543 | Hitchner | Oct 2000 | A |
6141647 | Meijer et al. | Oct 2000 | A |
6141674 | Unkrich et al. | Oct 2000 | A |
6144893 | Van Der Vegt et al. | Nov 2000 | A |
Number | Date | Country |
---|---|---|
WO 0067412 | Nov 2000 | WO |
WO 00.67412 | Nov 2000 | WO |
Number | Date | Country | |
---|---|---|---|
20020133320 A1 | Sep 2002 | US |
Number | Date | Country | |
---|---|---|---|
60262747 | Jan 2001 | US |