US6047221A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for steady-state identification based upon identified dynamics
Assignee: Rockwell Automation Technologies Inc
•
Filing: 1997-10-03
•
Granted: 2000-04-04
•
Expires: 2017-10-03
Abstract
Abstract A method for modeling a steady-state network in the absence of steady-state historical data. A steady-state neural network can be tied by impressing the dynamics of the system onto the input data during the training operation by first determining the dynamics in a local region of the input space, this providing a set of dynamic training data. This dynamic training data is then utilized to train a dynamic model, gain thereof then set equal to unity such that the dynamic model is now valid over the entire input space. This is a linear model, and the historical data over the entire input space is then processed through this model prior to input to the neural network during training thereof to remove the dynamic component from the data, leaving the steady-state component for the purpose of training. This provides a valid model in the presence of historical data that has a large content of dynamic behavior. A single dynamic model is required for each output variable in a multi-input multi-output steady-state model such that for each output there is a separate dynamic model required for pre-filtering. They are combined in a single network made up of multiple individual steady-state models for each output. The dynamic model can be identified utilizing a weighting factor for the gain to force the dynamic gain of the dynamic model to the steady-state gain by weighting the difference thereof during optimization of the dynamic model. The steady-state model is optimized utilizing gain constraints during the optimization procedure such that the gain of the network is prevented from exceeding the gain constraints.
Inventors
- 👤 Stephen Piche
- 👤 James David Keeler
- 👤 Eric Hartman
- 👤 William D. Johnson
- 👤 Mark Gerules
- 👤 Kadir Liano
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 10:04
CPC Classifications
G; G05; G05B; G05B17/00; G05B17/02; G05B13/00; G05B13/02; G05B13/04; G05B13/048
Claims Analysis
Total Claims: 41
Claim 1
Independent Claim
123 words
A method for training a steady-state non-linear model of a plant, comprising the steps of: generating an input set of historical training data representative of the historical operation of the plant and having input data u(t) and output data y(t); identifying a linear dynamic model of the plant representing the dynamics of the plant for a given output variable of the plant; pre-filtering the historical input data through the dynamic model to impress the dynamics of the plant as defined by the linear dynamic model on the input data u(t); and training a non-linear model of the plant with the pre-filtered input data u(t) to provide a stored representation of the steady-state operation in the non-linear model associated with the given output variable.
Claim 2
Independent Claim
123 words
A method for training a steady-state non-linear model of a plant, comprising the steps of: generating an input set of historical training data representative of the historical operation of the plant and having input data u(t) and output data y(t); identifying a linear dynamic model of the plant representing the dynamics of the plant for a given output variable of the plant; pre-filtering the historical input data through the dynamic model to impress the dynamics of the plant as defined by the linear dynamic model on the input data u(t); and training a non-linear model of the plant with the pre-filtered input data u(t) to provide a stored representation of the steady-state operation in the non-linear model associated with the given output variable.
Claim 3
Dependent Claim
68 words
The method of claim 1 wherein the step of training the non-linear model comprises training a non-linear neural network having an input layer, an output layer and a hidden layer for storing a learned representation of the plant and for mapping the input layer to the output layer through the learned representation of the plant, which learned representation of the plant comprises the steady-state operation of the plant.
Claim 4
Dependent Claim
33 words
The method of claim 1 wherein the step of identifying comprises identifying a linear dynamic model of the plant representing the dynamics of the plant in a defined portion of the input space.
Claim 5
Dependent Claim
46 words
The method of claim 3 wherein the step of training the non-linear model comprises training a non-linear model of the plant with the pre-filtered data to provide a stored representation of the steady-state operation in the non-linear model over a substantial portion of the input space.
Claim 6
Dependent Claim
92 words
The method of claim 1 wherein the step of identifying a linear model of a plant comprises: generating a set of dynamic data defining the dynamics of the plant over the defined portion of the input space over which the operation of the plant is linear; defining a linear dynamic model; and identifying the linear dynamic model utilizing the generated dynamic data over the defined portion of the input space such that the dynamics embodied within the identified linear dynamic model represent the dynamics of the plant over the entire input space.
Claim 7
Dependent Claim
22 words
The method of claim 5 and further comprising the step of normalizing the gain of the identified linear dynamic model to unity.
Claim 8
Dependent Claim
47 words
The method of claim 5 wherein the step of generating the set of dynamic data comprises performing a step test on the plant in a localized portion of input space from an initial steady-state value to a second value and then back to the initial steady-state value.
Claim 9
Dependent Claim
20 words
The method of claim 1 wherein the input set of historical training data has dynamics of the plant associated therewith.
Claim 10
Independent Claim
177 words
A method for training a steady-state, non-linear model of a plant having multiple input variables and multiple output variables, comprised of the steps of: generating an input of historical training data representative of the historical operations of the plant and having input data u(t) and output data y(t); identifying a plurality of linear dynamic models, one for each output variable of the plant, each of which represents the dynamics of the plant for the given output variables of the plant; pre-filtering the historical input data for each of the input variables through each of the dynamic models to impress the dynamics of the plant for the associated output variable with the associated dynamic model on the input data u(t); and training a plurality of non-linear models in the plant, each non-linear model associated with one of the output variables, and each of the non-linear models filtered with the pre-filtered input data u(t) for the associated output variable to provide a stored representation of the steady-state operation of each of the output variables in the associated non-linear model.
Claim 11
Independent Claim
177 words
A method for training a steady-state, non-linear model of a plant having multiple input variables and multiple output variables, comprised of the steps of: generating an input of historical training data representative of the historical operations of the plant and having input data u(t) and output data y(t); identifying a plurality of linear dynamic models, one for each output variable of the plant, each of which represents the dynamics of the plant for the given output variables of the plant; pre-filtering the historical input data for each of the input variables through each of the dynamic models to impress the dynamics of the plant for the associated output variable with the associated dynamic model on the input data u(t); and training a plurality of non-linear models in the plant, each non-linear model associated with one of the output variables, and each of the non-linear models filtered with the pre-filtered input data u(t) for the associated output variable to provide a stored representation of the steady-state operation of each of the output variables in the associated non-linear model.
Claim 12
Dependent Claim
41 words
The method of claim 9 and further comprising combining all of the non-linear models into a single combined model, such that a single multi-input multi-output model is provided, with each of the outputs having associated therewith one of the non-linear models.
Claim 13
Independent Claim
88 words
A method for training a steady-state model, the model having an input and an output and a mapping layer for mapping the input to the output through a stored representation of a plant, comprising: providing a training data set having a set of input data u(t) and target output data y(t) representative of the operation of a plant; training the model with a predetermined training algorithm; and constraining the training algorithm to maintain the sensitivity of the output with respect to the input substantially within user defined bounds.
Claim 14
Independent Claim
88 words
A method for training a steady-state model, the model having an input and an output and a mapping layer for mapping the input to the output through a stored representation of a plant, comprising: providing a training data set having a set of input data u(t) and target output data y(t) representative of the operation of a plant; training the model with a predetermined training algorithm; and constraining the training algorithm to maintain the sensitivity of the output with respect to the input substantially within user defined bounds.
Claim 15
Dependent Claim
29 words
The method of claim 11, wherein the model comprises a neural network having an input layer, an output layer and a hidden layer that provides the mapping layer operation.
Claim 16
Dependent Claim
52 words
The method of claim 11, wherein the training algorithm comprises a gradient based training algorithm for generating an error term during the operation of the training algorithm and minimizing this error term and wherein the step of constraining the training algorithm comprises minimizing the error term substantially within the user defined bounds.
Claim 17
Dependent Claim
14 words
The method of claim 13, wherein the training algorithm comprises a back propagation algorithm.
Claim 18
Dependent Claim
43 words
The method of claim 13, wherein the training algorithm minimizes an error E in accordance with the following: ##EQU32## where P is the number of training patterns, y p (t) comprises the output of the model and y(t) comprises the training data set.
Claim 19
Dependent Claim
32 words
The method of claim 15, wherein the sensitivity of the outputs with respect to the inputs during training are constrained between a first lower sensitivity limit and a second upper sensitivity limit.
Claim 20
Dependent Claim
15 words
The method of claim 16, wherein the upper and lower sensitivity limits are hard constraints.
Claim 21
Dependent Claim
31 words
The method of claim 16, wherein the constraints are soft limits wherein a penalty factor is attributed to the training algorithm when the upper and lower limits of sensitivity are violated.
Claim 22
Dependent Claim
66 words
The method of claim 18, wherein the back propagation algorithm with soft constraints is in accordance with the following relationship: ##EQU33## where H represents a predetermined non-negative penalty function for violating the constraints, λ represents a user defined weighting factor, G 1 represents a lower sensitivity limit, G h represents an upper sensitivity limit, G represents the sensitivity of the outputs with respect to the inputs.
Claim 23
Dependent Claim
14 words
The method of claim 15, wherein the sensitivity comprises the gain of the model.
Claim 24
Dependent Claim
21 words
The method of claim 11, wherein the sensitivity is defined as a sensitivity of each output with respect to each input.
Claim 25
Independent Claim
150 words
A method for developing a linear dynamic model of a plant, comprising the steps of: creating a linear model for predicting a dynamic response y(t) from an input u(t) and having a dynamic gain k d , which linear model can define the dynamic response of the plant; generating a training data set of dynamic input data u d (t) and output data y d (t); providing a user defined sensitivity value representing the sensitivity of the output of the plant with respect to the input of the plant at steady-state; training the linear model on the training data set with a predetermined training algorithm; and constraining the training algorithm with a scaled level of the difference between the dynamic gain and the user defined sensitivity such that an error generated with the training algorithm will increase as the difference between the dynamic gain and the user defined sensitivity increases.
Claim 26
Independent Claim
150 words
A method for developing a linear dynamic model of a plant, comprising the steps of: creating a linear model for predicting a dynamic response y(t) from an input u(t) and having a dynamic gain k d , which linear model can define the dynamic response of the plant; generating a training data set of dynamic input data u d (t) and output data y d (t); providing a user defined sensitivity value representing the sensitivity of the output of the plant with respect to the input of the plant at steady-state; training the linear model on the training data set with a predetermined training algorithm; and constraining the training algorithm with a scaled level of the difference between the dynamic gain and the user defined sensitivity such that an error generated with the training algorithm will increase as the difference between the dynamic gain and the user defined sensitivity increases.
Claim 27
Dependent Claim
21 words
The method of claim 22, wherein the training data set is generated over a localized region of the input data space.
Claim 28
Dependent Claim
36 words
The method of claim 23, wherein the step of generating the training data comprises step testing the plant by stepping the data from a steady-state value at u i (t) for each value of the input.
Claim 29
Dependent Claim
25 words
The method of claim 22, wherein the step of providing a user defined sensitivity comprises providing a user defined sensitivity over the entire input space.
Claim 30
Dependent Claim
56 words
The method of claim 25, wherein the step of providing the user defined sensitivity comprises providing a non-linear predictive network that represents a predictive model of the plant and which has a steady-state gain K ss , and wherein the average value of the gain K ss , K ss ', represents the user defined sensitivity.
Claim 31
Dependent Claim
16 words
The method of claim 22, wherein the predetermined training algorithm comprises a gradient based training algorithm.
Claim 32
Dependent Claim
55 words
The method of claim 27, wherein the step of providing the user defined sensitivity comprises providing a non-linear network that represents a predictive model of the plant and which has a steady-state gain K ss ', and wherein the average value of the gain K ss , K ss ', represents the user defined sensitivity.
Claim 33
Dependent Claim
46 words
The method of claim 28, wherein the training algorithm and the step of constraining operate in accordance with the following relationship: ##EQU34## where J=the error that is to be minimized and λ=a user defined weighting factor where y(t) is the predicted value and y(t) is y(t).
Claim 34
Dependent Claim
40 words
The method of claim 22, wherein the step of creating the linear model creates a linear model in accordance with the following relationship: y(t)=-α.sub.1 y(t-1)+-α.sub.2 y(t-2)+b.sub.1 u(t-d-1)+b.sub.2 u(t-d-2) where the dynamic gain k d is defined by the relationship: ##EQU35##
Claim 35
Dependent Claim
34 words
The method of claim 30, wherein the gain k d for the linear network is set equal to unity after training by varying the values b 1 and b 2 in the gain relationship.
Claim 36
Independent Claim
136 words
A method for determining the dead-time d between an input variable u(t) to a plant and an output variable y(t) from the plant, comprising the steps of: providing a historical data set of input variables u(t) for a given output variable y(t); defining a minimum dead-time d i ,min and a maximum dead-time d i ,max; varying the value of d i from d i ,min to d i ,max for each input variable u i (t-d i ); determining the strength of the statistical relationship between the input variable u(t) and the output variable y(t) for each value of i as d i varies from d imin to d imax ; and select the value of j for d i as the d i value having the strongest statistical relationship for the given input variable.
Claim 37
Independent Claim
136 words
A method for determining the dead-time d between an input variable u(t) to a plant and an output variable y(t) from the plant, comprising the steps of: providing a historical data set of input variables u(t) for a given output variable y(t); defining a minimum dead-time d i ,min and a maximum dead-time d i ,max; varying the value of d i from d i ,min to d i ,max for each input variable u i (t-d i ); determining the strength of the statistical relationship between the input variable u(t) and the output variable y(t) for each value of i as d i varies from d imin to d imax ; and select the value of j for d i as the d i value having the strongest statistical relationship for the given input variable.
Claim 38
Dependent Claim
67 words
The method of claim 32 wherein the step of determining determines the statistical independence of y(t) for a given value of u i (t-d i ) as d i varies from d i ,min--d i ,max, with the one of the u i (t-d i ) values for d i corresponding to the lowest statistical dependent comprising the strongest relationship value of u i (t-d i ).
Claim 39
Dependent Claim
37 words
The method of claim 33 wherein the step of determining utilizes mutual information (MI) in accordance with the following relationship: ##EQU36## wherein x 1 (t) represents u i (t-d j ) and x 2 (t) represents y(t).
Claim 40
Dependent Claim
48 words
The method of claim 34, wherein MI is computed by estimating the probability distribution of a given data set of u(t) and y(t) utilizing a binning method wherein a grid with two dimensions, u i (t-d i ) and y(t), is divided into a fixed number of divisions.
Claim 41
Dependent Claim
48 words
The method of claim 32 wherein a plurality of output variables y(t) and u i (t) and the step of determining the strength of the statistical relationship comprises determining the strength and the statistical between each of the input variables u(t) and each of the output variables y(t).
References Cited (Backward Citations)
US4868754A
Cited
US4922412A
Cited
EP0280948A1
Cited
US5251285A
Cited
US4964120A
Cited
WO1993015448A1
Cited
US5477444A
Cited
US5781432A
Cited
WO1996012990A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-04-04 | 2003-10-04 | 2004-04-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-04-04 | 2007-10-04 | 2008-04-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-04-04 | 2011-10-04 | 2012-04-04 | $7700.00 | Window Closed / Lapsed |