# Patent

## Title
Non-linear dynamic predictive device

## Abstract

A non-linear dynamic predictive device (60) is disclosed which operates either in a configuration mode or in one of three runtime modes: prediction mode, horizon mode, or reverse horizon mode. An external device controller (50) sets the mode and determines the data source and the frequency of data. In the forward modes (prediction and horizon), the data are passed to a series of preprocessing units (20) which convert each input variable (18) from engineering units to normalized units. Each preprocessing unit feeds a delay unit (22) that time-aligns the input to take into account dead time effects. The output of each delay unit is passed to a dynamic filter unit (24). Each dynamic filter unit internally utilizes one or more feedback paths that provide representations of the dynamic information in the process. The outputs (28) of the dynamic filter units are passed to a non-linear approximator (26) which outputs a value in normalized units. The output of the approximator is passed to a post-processing unit (32) that converts the output to engineering units. This output represents a prediction of the output of the modeled process. In reverse horizon mode, data is passed through the device in a reverse flow to produce a set of outputs (64) at the input of the predictive device. These are returned to the device controller through path (66). The purpose of the reverse horizon mode is to provide information for process control and optimization. The predictive device approximates a large class of non-linear dynamic processes. The structure of the predictive device allows it to be incorporated into a practical multivariable non-linear Model Predictive Control scheme, or used to estimate process properties.

## Background
RELATED APPLICATIONS
This application is a continuation-in-part of application Ser. No. 09/160,128 now U.S. Pat. No. 6,453,308, filed Sep. 24, 1998, which claims the benefit of U.S. Provisional Application No. 60/060,638 filed Oct. 1, 1997, the contents of which are incorporated herein by reference in their entirety.


I. FIELD OF THE INVENTION
The present invention pertains to a predictive device that models the dynamic input/output relationships of a physical process, particularly in the process industries such as hydrocarbons, polymers, pulp and paper, and utilities. The predictive device is primarily for multivariable process control, but is also applicable to dynamic process monitoring, or to provide a continuous stream of inferred measurements in place of costly or infrequent laboratory or analyzer measurements.
II BACKGROUND OF THE INVENTION
Most existing industrial products designed for multivariable model predictive control (MPC) employ linear step-response models or finite impulse response (FIR) models. These approaches result in over-parameterization of the models (Qin and Badgwell, 1996). For example, the dynamics of a first order single input/single output SISO process which can be represented with only three parameters (gain, time constant and dead-time) in a parametric form typically require from 30 to 120 coefficients to describe in a step-response or FIR model. This over-parameterization problem is exacerbated for non-linear models since standard non-parametric approaches, such as Volterra series, lead to an exponential growth in the number of parameters to be identified. An alternative way to overcome these problems for non-linear systems is the use of parametric models such as input-output Nonlinear Auto-Regressive with eXogenous inputs (NARX). Though NARX models are found in many case-studies, a problem with NARX models using feed forward neural networks is that they offer only short-term predictions (Su, et al, 1992). MPC controllers require dynamic models capable of providing long-term predictions. Recurrent neural networks with internal or external feedback connections provide a better solution to the long-term prediction problem, but training such models is very difficult.
The approach described in (Graettinger, et al, 1994) and (Zhao, et al, 1997) provides a partial solution to this dilemma. The process model is identified based on a set of decoupled first order dynamic filters. The use of a group of first order dynamic filters in the input layer of the model enhances noise immunity by eliminating the output interaction found in NARX models. This structure circumvents the difficulty of training a recurrent neural network, while achieving good long-term predictions. However, using this structure to identify process responses that are second order or higher can result in over sensitive coefficients and in undesirable interactions between the first order filters. In addition, this approach usually results in an oversized model structure in order to achieve sufficient accuracy, and the model is not capable of modeling complex dynamics such as oscillatory effects. In the single input variable case, this first order structure is a special case of a more general nonlinear modeling approach described (Sentoni et al., 1996) that is proven to be able to approximate any discrete, causal, time invariant, nonlinear SISO process with fading memory. In this approach a Laguerre expansion creates a cascaded configuration of a low pass and several identical band pass first order filters. One of the problems of this approach is that may it require an excessively large degree of expansion to obtain sufficient accuracy. Also, it has not been known until now how to extend this methodology in a practical way to a multi-input system.
This invention addresses many essential issues for practical non-linear multivariable MPC. It provides the capability to accurately identify non-linear dynamic processes with a structure that

    has close to minimum parameterization
    can be practically identified with sufficient accuracy
    makes good physical sense and allows incorporation of process knowledge
    can be proven to identify a large class of practical processes
    can provide the necessary information for process control


III SUMMARY OF THE INVENTION
The present invention is a dynamic predictive device that predicts or estimates values of process variables that are dynamically dependent on other measured process variables. This invention is especially suited to application in a model predictive control (MPC) system. The predictive device receives input data under the control of an external device controller. The predictive device operates in either configuration mode or one of three runtime modes—prediction mode, horizon mode, or reverse horizon mode.
The primary runtime mode is the prediction mode. In this mode, the input data are such as might be received from a distributed control system (DCS) as found in a manufacturing process. The device controller ensures that a contiguous stream of data from the DCS is provided to the predictive device at a synchronous discrete base sample time. The device controller operates the predictive device once per base sample time and receives the prediction from the output of the predictive device.
After the prediction mode output is available, the device controller can switch to horizon mode in the interval before the next base sample time. The predictive device can be operated many times during this interval and thus the device controller can conduct a series of experimental scenarios in which a sequence of input data can be specified by the device controller. The sequence of input data can be thought of as a data path the inputs will follow over a forward horizon. The sequence of predictions at the output of the controller is a predicted output path over a prediction horizon and is passed to the device controller for analysis, optimization, or control. The device controller informs the predictive device at the start of an experimental path and synchronizes the presentation of the path with the operation of the device. Internally, horizon mode operates exactly the same way as prediction mode, except that the dynamic states are maintained separately so that the predictive device can resume normal prediction mode operation at the next base sample time. In addition, the outputs of the filter units are buffered over the course of the path and are used during reverse horizon operation of the device.
The purpose of reverse horizon mode is to obtain the sensitivities of the predictive device to changes in an input path. Reverse horizon mode can only be set after horizon mode operation has occurred. The device controller first informs the predictive device the index of the point in the output path for which sensitivities are required. The device controller then synchronizes the reverse operation of the predictive device with the output of sensitivity data at the input paths of the device.
In forward operation, each input is scaled and shaped by a preprocessing unit before being passed to a corresponding delay unit which time-aligns data to resolve dead time effects such as pipeline transport delay. Modeling dead-times is an important issue for an MPC system. In practical MPC, prediction horizons are usually set large enough so that both dynamics and dead-time effects are taken into account; otherwise the optimal control path may be based on short term information, and the control behavior may become oscillatory or unstable. In the preferred embodiment, the predictive device is predicting a single measurement, and the dead-time units align data relative to the time of that measurement. If predictions at several measurement points are required, then several predictive devices are used in parallel. During configuration mode, the dead times are automatically estimated using training data collected from the plant. In the preferred embodiment the training method consists of constructing individual auto-regressive models between each input and the output at a variety of dead-times, and choosing the dead time corresponding to the best such model. As with other components of the invention, manual override of the automatic settings is possible and should be used if there is additional process knowledge that allows a more appropriate setting.
Each dead time unit feeds a dynamic filter unit. The dynamic filter units are used to represent the dynamic information in the process. Internally the dynamic filter units recursively maintain a vector of states. The states derive their values from states at the previous time step and from the current input value. This general filter type can be represented by what is known to those skilled in the art as a discrete state space equation. The preferred embodiment imposes a much-simplified structure on the filter unit that allows for fast computation for MPC and also allows intelligent override of the automatic settings. This simplified structure is composed of first and second order loosely coupled subfilters, only one of which receives direct input from the corresponding delay unit. The practical identification of this filter structure is an essential part of this invention.
The outputs of the dynamic filter units are passed to a non-linear analyzer that embodies a static mapping of the filter states to an output value. The exact nature of the non-linear analyzer is not fundamental to this invention. It can embody a non-linear mapping such as a Non-linear Partial Least Squares model or a Neural Network, or a hybrid combination of linear model and non-linear model. The preferred embodiment makes use of a hybrid model. The reason for this is that a non-parametric non-linear model identified from dynamic data (such as a neural net) cannot, by its nature, be fully analyzed and validated prior to use. The non-linearity of the model means that different dynamic responses will be seen at different operating points. If the process being modeled is truly non-linear, these dynamic responses will be an improvement over linear dynamic models in operating regions corresponding to the training data, but may be erroneous in previously unseen operating regions. When the non-linear model is used within the context of MPC, erroneous responses, especially those indicating persistent and invalid gain reversals can create instabilities in the MPC controller. With a hybrid approach, a non-linear model is used to model the errors between the linear dynamic model and the true process. The hybrid dynamic model is a parallel combination of the linear dynamic model with the error correction model. The dynamic response of the linear model can be analyzed completely prior to use, since the gains are fixed and independent of the operating point. The process engineer can examine and approve these gains prior to closing the loop on the process and is assured of responses consistent with the true process. However, the linear dynamic response will be sub-optimal for truly non-linear processes. In online operation of the hybrid model within an MPC framework, the responses of the linear model and the hybrid model can be monitored independently and compared. In operating regions where the non-linear model shows persistently poor response, control can be switched, either automatically or by the operator, back to the safety of the linear model.
The output of the non-linear analyzer is passed through a postprocessing unit that converts the internal units to engineering units.
The importance of this invention is that its structure is shown to be able to approximate a large class of non-linear processes (any discrete, causal, time invariant, nonlinear multi-input/single output (MISO) process with fading memory), but is still simple enough to allow incorporation of process knowledge, is computationally fast enough for practical non-linear MPC, and can be configured with sufficient accuracy in a practical manner.



IV BRIEF DESCRIPTION OF THE DRAWINGS
The textual description of the present invention makes detailed reference to the following drawings:
FIG. 1 is an overall block diagram of the invention showing both the runtime and training components.
FIG. 2 shows the runtime structure of an individual preprocessing unit.
FIG. 3 shows the runtime structure of an individual delay unit.
FIG. 4 shows the forward flow internal decomposition of an individual filter unit into cascaded subfilter units.
FIG. 5 shows the preferred forward flow structure of a primary first order subfilter unit.
FIG. 6 shows the preferred forward flow structure of a secondary first order subfilter unit and the preferred coupling with the previous subfilter in the cascade.
FIG. 7 shows the preferred forward flow structure of a primary second order subfilter unit.
FIG. 8 shows the preferred forward flow structure of a secondary second order subfilter unit and the preferred coupling with the previous subfilter in the cascade.
FIG. 9 shows a typical feedforward configuration of the non-linear analyzer.
FIG. 10 shows the reverse flow configuration of the non-linear analyzer depicted in FIG. 9.
FIG. 11 shows the reverse flow internal decomposition of an individual filter unit into cascaded subfilter units.
FIG. 12 shows a method of training an individual delay unit.
FIG. 13 shows the first order decoupled structure used at the start of each iteration of the preferred dynamic filter unit identification method.
FIG. 14 shows that reverse flow of data through a matrix structure can be described mathematically by forward flow of data through the transpose matrix structure.



V DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
FIG. 1 is an overall block diagram of the invention and its context. An external device controller (50) synchronizes the flow of data to and from the predictive device via the data paths (18), (14), and (64). The device controller also controls the mode of operation and the path stepping of the predictive device via the control path (54). The external device controller may also communicate with a DCS (10) or other data/control system both for requesting data and for requesting control changes to the modeled process; however the exact external context and configuration of the device controller is beyond the scope of this application.
V.1 Forward Runtime Operation of the Prediction Device
The figures and equations in this detailed description refer to an index k that represents a data point in a sequence of data points. This index has different meanings depending on whether the forward operational mode of the device is prediction mode or horizon mode.
In prediction mode data is provided at a regular sampling interval Δt to the input nodes (18) of the device. Data is passed in a forward direction through the device. For simplicity of notation, the sample point T0+kΔt is denoted by the index k.
In horizon mode, a sequence of data representing a forward data path is provided to the inputs. This data path may represent a proposed path for manipulated variables for process control purposes, or may represent a holding of the inputs to constant values in order to determine the steady state output of the device. The starting point of this path is taken to be the most recent input sample provided in prediction mode. Index 0 represents this starting point and index k represents the kth data point in this path.
V.1.1 Forward Runtime Operation of a Preprocessing Unit
Each input feeds a preprocessing unit (20) which is used to convert the engineering units of each data value to a common normalized unit whose lower and upper limits are, by preference, −1 and 1 respectively, or 0 and 1 respectively.
The preprocessing unit can also shape the data by passing it through a non-linear transformation. However, the preferred embodiment uses a simple scale and offset as shown in FIG. 2 and equation (1):

u(k)=suE(k)+o  (1)

where uE(k) is the value of an input in engineering units, and u(k) is the preprocessed value in normalized units. The scale and offset values as stored in the configuration file (30—FIG. 1) are, in general, different for each input variable, and are determined in the configuration mode.

V.1.2 Forward Runtime Operation of a Delay Unit

Data flows from each preprocessing unit to a corresponding delay unit (22). The forward run-time operation of the delay unit (22) is shown in FIG. 3 and equation (2). The output ud(k)(304) of an individual delay unit (300) is equal to the input u(k) (302) delayed by d sample times. The value of d may be different for each delay unit (22) and is retrieved from the configuration file (30—FIG. 1). This may be implemented as a shift register with a tap at the dth unit.

ud(k)=u(k−d)  (2)

This equation can also be written in terms of the unit delay operator q−1:

ud(k)=q−du(k)

V.1.3 Forward Runtime Operation of the Filter Units

Referring again to FIG. 1, each delayed input value is passed to an individual filter unit (24). The general internal feedforward structure of a filter unit (24) is shown in FIG. 4. The general feedforward structure is composed of S cascaded subfilters (402, 404, . . . , 406). The first subfilter in the cascade (400) is referred to as the primary subfilter. Non-primary subfilters are referred to as secondary subfilters. All the subfilters are alike except that the primary subfilter receives no input from another subfilter, and the final subfilter sends no output to another subfilter. Now the general form of the primary subfilter will be described in detail.
The primary subfilter maintains a vector (412) of states x1(k) at each time k. An internal single time step delay unit (414) feeds the vector state to a coupling unit (420) and to a matrix unit (416). The matrix unit converts the delayed state vector (418) and feeds it to a vector addition unit (408). The input to the filter unit ud(k) is expanded and linearly scaled by the input coupling unit (410) to a vector of values of the same dimension as the state vector. The vector addition unit then combines its two input streams to produce the vector of states for the current time. The operation just described for the primary subfilter is conveniently described in mathematical matrix and column vector notation as:

x1(k)=A1x1(k−1)+b1ud(k)  (3)

Such an equation is known, to those skilled in the art, as a linear state space equation with a single input. If no structure is imposed on A1 or b1, then further subfilters are unnecessary since the cascaded subfilter structure can subsumed into a single complicated primary subfilter. However, the preferred subfilter structures as described below, or similar to those described below, are essential for a practical embodiment and application of the invention.

The subfilter coupling unit (420) determines how state values at time k−1 affect the state units in the next subfilter at time k. In mathematical terms, the subfilter coupling unit uses the coupling matrix Γ2 to perform a linear transformation of state vector x1(k−1) which is passed to the vector addition unit of the next subfilter. The operation of a secondary subfilter is conveniently described in mathematical matrix and vector notations as:

xs(k)=Asxs(k−1)+Γsxs−1(k−1)+bsud(k)  (4)

In the preferred embodiment, the subfilters are all of first or second order. A first order subfilter maintains just one state. The preferred embodiment for a first order primary subfilter (500) is shown in FIG. 5. The vectorizing unit (502) and the matrix unit (504) collapse to become scaling operations so that the state vector (506) is represented by:

x1(k)=λ1x1(k−1)+(1−λ1)ud(k)  (5)

The preferred embodiment for a first order secondary subfilter (600) is shown in FIG. 6. The secondary subfilter receives no direct input, but instead receives cascaded input from the previous subfilter. The preferred coupling is a loose coupling scheme (602) in which only the last state component of the previous subfilter contributes. Note that the previous subfilter is not required to be a first order subfilter. The state vector (606) is represented by:

xs(k)=λsxs(k−1)+(1−λs)xs−1,last(k−1)  (6)

where the matrix unit λs (604) is a scalar.

Second order subfilters maintain two states. The preferred embodiment for a second order primary subfilter (700) is shown in FIG. 7. In this figure, the state vector x1(k) is shown in terms of its two components x11(k) (708) and x12(k) (710). The vectorizing unit (702) creates two inputs to the vector addition unit (714), the second of which is fixed at zero. The delayed states (704) and (706) are fed to the matrix unit (712) whose outputs are also fed to the vector addition unit (712) which adds the matrix transformed states to the vectorized inputs producing the current state. Note that due to the (1,0) structure of the second matrix row, and the zero second component of the vectorizing unit component, the current second state component (710) is just equal to the delayed first component (704):

x11(k)=a11x11(k−1)+a12x12(k−1)+(1−a11−a12)ud(k)

x12(k)=x11(k−1)  (7)

The preferred embodiment for a second order secondary subfilter (800) is shown in FIG. 8. In this figure, the state vector xs(k) is shown in terms of its two components xs1(k) (808) and xs2(k) (810). The preferred coupling with the previous subfilter unit is a loose coupling scheme (802) in which only the last state component of the previous subfilter contributes to the first state component of the current subfilter. Note that the previous subfilter is not required to be a first order subfilter or second order subfilter. The output of the coupling unit is fed to the addition unit (814). The delayed states (804) and (806) are fed to the state matrix unit (812) whose outputs are also fed to the vector addition unit (812) which adds the state matrix transformed states to the output of the coupling unit, producing the current state. Note that due to the (1,0) structure of the second state matrix row, and the zero second row of the coupling matrix, the current second state component (810) is just equal to the delayed first component (804):

xs1(k)=as1xs1(k−1)+as2xs2(k−1)+(1−as1−as2)xs−1,last(k−1)

xs2(k)=xs1(k−1)  (8)

If the device is operating in horizon mode current states along the path are maintained in a separate storage area so as not to corrupt the prediction mode states. In horizon mode, k indexes the input path and the states are initialized at the start of the path (k=0) to the prediction mode states. In addition the states at the output of the filter unit are buffered for use in reverse horizon mode.
V.1.4 Forward Runtime Operation of the Non-Linear Analyzer
Referring again to FIG. 1, the outputs (28) of the filter units (24) provide input to the non-linear analyzer (26). The exact structure and configuration of the non-linear analyzer (26) is not central to this application. It is the interaction of the non-linear analyzer (26) with the filter units (24), and the operation and configuration of the filter units (24) that forms the core of this invention. The preferred embodiment, for reasons discussed in the summary of the invention is a hybrid parallel combination of linear and non-linear. However, for clarity of explanation, a standard neural network structure is described which is well known to those skilled in the art. This structure is shown in FIG. 9. The equations for this structure are: 



  
    
      
        
          
            
              
                
                  ξ
                  h
                
                ⁡
                
                  (
                  k
                  )
                
              
              =
              
              ⁢
              
                
                  w
                  h0
                
                +
                
                  
                    ∑
                    
                      i
                      =
                      1
                    
                    N
                  
                  ⁢
                  
                    
                      w
                      hi
                    
                    ⁢
                    
                      
                        x
                        i
                      
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                  
                
              
            
          
        
        
          
            
              
                
                  η
                  h
                
                ⁡
                
                  (
                  k
                  )
                
              
              =
              
              ⁢
              
                tanh
                ⁡
                
                  (
                  
                    
                      ξ
                      h
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                  )
                
              
            
          
        
        
          
            
              
                y
                ⁡
                
                  (
                  k
                  )
                
              
              =
              
              ⁢
              
                
                  ∑
                  
                    h
                    =
                    1
                  
                  H
                
                ⁢
                
                  
                    c
                    h
                  
                  ⁢
                  
                    
                      η
                      h
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                
              
            
          
        
      
    
    
      
        (
        9
        )
      
    
  




V.1.5 Forward Runtime Operation of the Postprocessing Unit

The postprocessing unit (32) in FIG. 1 is used to scale the output from the normalized units to engineering units. The postprocessing unit can also shape the data by passing it through a non-linear transformation. However, the preferred embodiment uses a simple scale and offset. For consistency with the preprocessing units, the scale and offset represent the mapping from engineering units to normalized units. 



  
    
      
        
          
            y
            E
          
          ⁡
          
            (
            k
            )
          
        
        =
        
          
            
              1
              s
            
            ⁢
            
              y
              ⁡
              
                (
                k
                )
              
            
          
          -
          
            o
            s
          
        
      
    
    
      
        (
        10
        )
      
    
  




The scale and offset values as stored in the configuration file (30—FIG. 1) and are determined in the configuration mode.
V.2 Reverse Runtime Operation of the Prediction Device
The reverse horizon mode of operation is only allowed immediately following horizon mode operation. Horizon mode operation buffers the states (28) output by the filter units (24) over the course of the forward path. The purpose of reverse horizon mode is to obtain the sensitivity of any point y(k) of the prediction path (output by the device in horizon mode) with respect to any point in the input path u(l).
In order to use the invention for process control applications, the mathematical derivatives of the prediction with respect to the inputs are required. The mathematical derivatives measure how sensitive a state is in response to a small change in an input. The dynamic nature of the predictive device means that a change in input at time k will start to have an effect on the output as soon as the minimum dead-time has passed and will continue to have an effect infinitely into the future. In most practical applications systems are identified to have fading memory so that the effect into the future recedes with time. For MPC applications the aim is to plan a sequence of moves for the inputs corresponding to manipulated variables (MVs). The effect of these moves needs to be predicted on the controlled variables (CVs) along a prediction path. A constrained optimization algorithm is then used to find the move sequences that predict an optimal prediction path according to some desired criteria.
In reverse horizon mode, the external device controller specifies the output path index k. The device then outputs in sequence the sensitivities (64) in reverse order at the input nodes of the device. In the detailed description below, the sensitivity of the output YE(k) of the device with respect to any variable v is represented by Ωkv. It is this sensitivity value, rather than an external data value that is fed back through the device when operating in reverse horizon mode.
V.2.1 Reverse Runtime Operation of the Postprocessing Unit
The reverse operation of the postprocessing unit (32) is to scale data received at its output node using the inverse of the feedforward scaling shown in equation (10):

Ωky(k)=sΩkyE(k)  (11)

Since the sensitivity of the output with respect to itself is:

ΩkyE(k)=1  (12)

the postprocessing unit always receives the value of 1 at its output node in reverse operation.

V.2.2 Reverse Runtime Operation of the Non-Linear Analyzer

The reverse runtime operation of a neural net model is well known to those skilled in the art and is shown in FIG. 10. The output from the reverse operation of the postprocessing unit Ωky(k) is presented at the output node of the non-linear analyzer (26). The information flows in a reverse manner through the non-linear analyzer (26) and the resulting sensitivities (62) are output at the input nodes of the non-linear analyzer (26): 



  
    
      
        
          
            
              
                
                  Ω
                  k
                
                ⁢
                
                  
                    η
                    h
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
              
              =
              
              ⁢
              
                
                  c
                  h
                
                ⁢
                Ω
                ⁢
                
                   
                
                ⁢
                
                  y
                  ⁡
                  
                    (
                    k
                    )
                  
                
              
            
          
        
        
          
            
              
                
                  Ω
                  k
                
                ⁢
                
                  
                    ξ
                    h
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
              
              =
              
              ⁢
              
                
                  Ω
                  k
                
                ⁢
                
                  
                    η
                    h
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
                ⁢
                
                  
                    tanh
                    ′
                  
                  ⁡
                  
                    (
                    
                      
                        ξ
                        h
                      
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                    )
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  Ω
                  k
                
                ⁢
                
                  
                    η
                    h
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
                ⁢
                
                  (
                  
                    1
                    -
                    
                      
                        η
                        h
                      
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                  
                  )
                
                ⁢
                
                  (
                  
                    1
                    +
                    
                      
                        η
                        h
                      
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                  
                  )
                
              
            
          
        
        
          
            
              
                
                  Ω
                  k
                
                ⁢
                
                  
                    x
                    i
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
              
              =
              
              ⁢
              
                
                  ∑
                  
                    h
                    =
                    1
                  
                  H
                
                ⁢
                
                  
                    w
                    hi
                  
                  ⁢
                  
                    Ω
                    k
                  
                  ⁢
                  
                    
                      ξ
                      h
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                
              
            
          
        
      
    
    
      
        (
        13
        )
      
    
  




V.2.3 Reverse Runtime Operation of a Filter Unit

The effect of a change in the delayed input ud(l) on a the sequence of states being output from a filter unit (24) in horizon mode is complex due to the dependencies of a subfilter's states based on the previous subfilter's states and on the subfilter's previous states. An efficient solution can be derived using the chain rule for ordered derivatives (Werbos, 1994) and is achieved by the reverse operation of the filter unit (24). In reverse horizon mode, the output of each filter unit (24) receives the vector of sensitivities Ωsxs(k) propagated back from the non-linear analyzer (26) operating in reverse mode: 



  
    
      
        
          
            
              
                
                  Ω
                  k
                
                ⁢
                
                  
                    x
                    s
                  
                  ⁡
                  
                    (
                    l
                    )
                  
                
              
              =
              
              ⁢
              
                {
                
                  
                    
                      
                        
                          Ω
                          k
                        
                        ⁢
                        
                          
                            x
                            s
                          
                          ⁡
                          
                            (
                            k
                            )
                          
                        
                      
                    
                    
                      
                        l
                        =
                        k
                      
                    
                  
                  
                    
                      
                        
                          
                            A
                            s
                            T
                          
                          ⁡
                          
                            (
                            
                              
                                Ω
                                k
                              
                              ⁢
                              
                                
                                  x
                                  s
                                
                                ⁡
                                
                                  (
                                  
                                    l
                                    +
                                    1
                                  
                                  )
                                
                              
                            
                            )
                          
                        
                        +
                        
                          
                            Γ
                            
                              s
                              +
                              1
                            
                            T
                          
                          ⁡
                          
                            (
                            
                              
                                Ω
                                k
                              
                              ⁢
                              
                                
                                  x
                                  
                                    s
                                    +
                                    1
                                  
                                
                                ⁡
                                
                                  (
                                  
                                    l
                                    +
                                    1
                                  
                                  )
                                
                              
                            
                            )
                          
                        
                      
                    
                    
                      
                        
                          l
                          <
                          k
                        
                        ,
                        
                          1
                          ≤
                          s
                          <
                          S
                        
                      
                    
                  
                  
                    
                      
                        
                          A
                          s
                          T
                        
                        ⁡
                        
                          (
                          
                            
                              Ω
                              k
                            
                            ⁢
                            
                              
                                x
                                s
                              
                              ⁡
                              
                                (
                                
                                  l
                                  +
                                  1
                                
                                )
                              
                            
                          
                          )
                        
                      
                    
                    
                      
                        
                          l
                          <
                          k
                        
                        ,
                        
                          s
                          =
                          S
                        
                      
                    
                  
                  
                    
                      0
                    
                    
                      
                        l
                        >
                        k
                      
                    
                  
                
              
            
          
        
        
          
            
              
                
                  Ω
                  k
                
                ⁢
                
                  
                    u
                    d
                  
                  ⁡
                  
                    (
                    l
                    )
                  
                
              
              =
              
              ⁢
              
                
                  ∑
                  
                    s
                    =
                    1
                  
                  S
                
                ⁢
                
                  
                    b
                    s
                    T
                  
                  ⁢
                  
                    Ω
                    k
                  
                  ⁢
                  
                    
                      x
                      s
                    
                    ⁡
                    
                      (
                      l
                      )
                    
                  
                
              
            
          
        
      
    
    
      
        (
        14
        )
      
    
  




The operation of these equations is shown in FIG. 11, which shows the filter structure of FIG. 4, but with data flowing in the reverse direction. Given the point k in the output path for which the sensitivities are being calculated, the vector of sensitivities Ωkxs(k) is presented at the output channels (1120, 1122 . . . 1124) of the filter unit (24) and cycled in reverse through the filter structure. This reverse operation is indexed by l≦k. At each iteration l, the resulting sensitivity Ωkud(l) is output at the input channel (1110) of the filter unit (24). For l<k the external input at the output channels (1120, 1122 . . . 1124) is in practice zero vector since Ωkxs(l)=0. However, the filter unit (24) itself is not constrained to operate under this assumption.
In FIG. 11, the reverse operation of a delay (1130) is represented by q which is the unit delay in the reverse time direction since the index l is decreasing at each iteration.
The reverse operation of a matrix operation (1132, 1134) or a vector operation (1136) is represented mathematically as the transpose of the forward operation. The physical justification for this is shown in FIG. 14 which shows the individual channels represented by a 3×2-matrix operation which in forward operation maps two input channels to three output channels, and in reverse operation maps three input channels to two output channels.
V.2.4 Reverse Runtime Operation of a Delay Unit
The reverse operation of a delay unit (22) corresponds to a delay in the reverse sequencing:

Ωku(l)=Ωkud(l+d)  (15)

V.2.5 Reverse Runtime Operation of a Preprocessing Unit

The reverse operation of a preprocessing unit (20) is to scale data received at its output node using the inverse of the feedforward scaling shown in equation (1): 



  
    
      
        
          
            Ω
            k
          
          ⁢
          
            
              u
              E
            
            ⁡
            
              (
              l
              )
            
          
        
        =
        
          
            1
            s
          
          ⁢
          
            Ω
            k
          
          ⁢
          
            u
            ⁡
            
              (
              l
              )
            
          
        
      
    
    
      
        (
        16
        )
      
    
  




V.3 Configuration Mode

The predictive device is configured, in the preferred embodiment, using training data collected from the process. However, a process engineer can override any automated configuration settings. The training data set should represent one or more data sets which have been collected at the same base-time sample rate that will be used by the external device controller to present data to the predictive device in prediction mode. Each set of data should represent a contiguous sequence of representative.
In order to allow operator approval or override of the configuration settings, the training of the predictive device is done in stages, each stage representing a major component of the predictive device.
V.3.1 Configuring the Preprocessing and Postprocessing Units
The scale and offset of a preprocessing or postprocessing unit is determined from the desire to map the minimum Emin and maximum Emax of the corresponding variable's engineering units to the minimum Nmin and maximum Nmax of the normalized units: 



  
    
      
        
          s
          =
          
            
              
                N
                max
              
              -
              
                N
                min
              
            
            
              
                E
                max
              
              -
              
                E
                min
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          o
          =
          
            
              
                
                  E
                  max
                
                ⁢
                
                  N
                  min
                
              
              -
              
                
                  E
                  min
                
                ⁢
                
                  N
                  max
                
              
            
            
              
                E
                max
              
              -
              
                E
                min
              
            
          
        
      
    
    
      
        (
        17
        )
      
    
  




The preferred normalized units have Nmin=−1, Nmax=1. The engineering units may be different for each input variable, leading to a different scale and offset for each preprocessing/postprocessing unit.

V.3.2 Configuring a Delay Unit

The configuration of a delay unit (22) is not a central aspect of this application. FIG. 12 shows a simple advisory procedure for suggesting delay times. A process engineer can override these advisory settings. In this procedure dmin and dmax are user settable limits for the delay time and the procedure calculates a delay time d such that

dmin≦d≦dmax

V.3.3 Configuring a Filter Unit

A practical means of configuring a filter unit (24) is an essential aspect of this invention. The preferred method of configuration is initialized using the simplified filter structure shown in FIG. 13 in which all subfilters are first order and decoupled. This is the structure used in (Graettinger, et al, 1994). It is important to note that this structure is used for initialization of the configuration procedure and does not represent the final suggested filter configuration.
Step 1
The operator specifies an appropriate dominant time constant Ti associated with each input variable. This can be specified from engineering knowledge or through an automated approach such as Frequency Analysis or a Back Propagation Through Time algorithm. The value of the initial time constant is not critical the proposed configuration method automatically searches the dominant time range for the best values.
Step 2
For each input, initialize the filter structure in FIG. 13 using a high order system where a number of first order filters are created around the given dominant time constant (dominant frequency, dominant dynamics). For example, a fifth order system can be created using: 



  
    
      
        
          
            
              
                λ
                i1
              
              =
              
              ⁢
              
                e
                
                  -
                  
                    
                      Δ
                      ⁢
                      
                         
                      
                      ⁢
                      t
                    
                    
                      0.5
                      ⁢
                      
                        T
                        i
                      
                    
                  
                
              
            
          
        
        
          
            
              
                λ
                i2
              
              =
              
              ⁢
              
                e
                
                  -
                  
                    
                      Δ
                      ⁢
                      
                         
                      
                      ⁢
                      t
                    
                    
                      0.75
                      ⁢
                      
                        T
                        i
                      
                    
                  
                
              
            
          
        
        
          
            
              
                λ
                i3
              
              =
              
              ⁢
              
                e
                
                  -
                  
                    
                      Δ
                      ⁢
                      
                         
                      
                      ⁢
                      t
                    
                    
                      T
                      i
                    
                  
                
              
            
          
        
        
          
            
              
                λ
                i4
              
              =
              
              ⁢
              
                e
                
                  -
                  
                    Δt
                    
                      1.25
                      ⁢
                      
                        T
                        i
                      
                    
                  
                
              
            
          
        
        
          
            
              
                λ
                i5
              
              =
              
              ⁢
              
                e
                
                  -
                  
                    
                      Δ
                      ⁢
                      
                         
                      
                      ⁢
                      t
                    
                    
                      1.5
                      ⁢
                      
                        T
                        i
                      
                    
                  
                
              
            
          
        
      
    
    
      
        (
        18
        )
      
    
  




In this simple filter structure, each subfilter (1302, 1304, 1306) yields a corresponding single state (1312, 1314, 1316) which is decoupled from the other subfilter states. This initial filter structure represents the equation

x(k)=Ax(k−1)+Bud(k)  (19)

which has a simplified diagonal block structure of the form 



  
    
      
        
          
            
              
                
                  x
                  ⁡
                  
                    (
                    k
                    )
                  
                
                =
                
                ⁢
                
                  [
                  
                    
                      
                        
                          
                            x
                            1
                          
                          ⁡
                          
                            (
                            k
                            )
                          
                        
                      
                    
                    
                      
                        
                          
                            x
                            2
                          
                          ⁡
                          
                            (
                            k
                            )
                          
                        
                      
                    
                    
                      
                        ⋮
                      
                    
                    
                      
                        
                          
                            x
                            N
                          
                          ⁡
                          
                            (
                            k
                            )
                          
                        
                      
                    
                  
                  ]
                
              
            
          
          
            
              
                A
                =
                
                ⁢
                
                  [
                  
                    
                      
                        
                          A
                          1
                        
                      
                      
                        0
                      
                      
                        0
                      
                      
                        0
                      
                    
                    
                      
                        0
                      
                      
                        
                          A
                          2
                        
                      
                      
                        0
                      
                      
                        ⋮
                      
                    
                    
                      
                        0
                      
                      
                        0
                      
                      
                        ⋰
                      
                      
                        0
                      
                    
                    
                      
                        0
                      
                      
                        0
                      
                      
                        ⋯
                      
                      
                        
                          A
                          N
                        
                      
                    
                  
                  ]
                
              
            
          
          
            
              
                B
                =
                
                ⁢
                
                  [
                  
                    
                      
                        
                          b
                          1
                        
                      
                      
                        0
                      
                      
                        0
                      
                      
                        0
                      
                    
                    
                      
                        0
                      
                      
                        
                          b
                          2
                        
                      
                      
                        0
                      
                      
                        ⋮
                      
                    
                    
                      
                        0
                      
                      
                        0
                      
                      
                        ⋰
                      
                      
                        0
                      
                    
                    
                      
                        0
                      
                      
                        0
                      
                      
                        ⋯
                      
                      
                        
                          b
                          N
                        
                      
                    
                  
                  ]
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        where
      
    
    
      
        (
        20
        )
      
    
  
  
    
      
        
          
            
              
                x
                i
              
              =
              
              ⁢
              
                [
                
                  
                    
                      
                        x
                        i1
                      
                    
                  
                  
                    
                      
                        x
                        i2
                      
                    
                  
                  
                    
                      ⋮
                    
                  
                  
                    
                      
                        x
                        i5
                      
                    
                  
                
                ]
              
            
          
        
        
          
            
              
                A
                i
              
              =
              
              ⁢
              
                [
                
                  
                    
                      
                        λ
                        i1
                      
                    
                    
                      0
                    
                    
                      0
                    
                    
                      0
                    
                  
                  
                    
                      0
                    
                    
                      
                        λ
                        i2
                      
                    
                    
                      0
                    
                    
                      ⋮
                    
                  
                  
                    
                      0
                    
                    
                      0
                    
                    
                      ⋰
                    
                    
                      0
                    
                  
                  
                    
                      0
                    
                    
                      0
                    
                    
                      ⋯
                    
                    
                      
                        λ
                        i5
                      
                    
                  
                
                ]
              
            
          
        
        
          
            
              
                b
                i
              
              =
              
              ⁢
              
                [
                
                  
                    
                      
                        1
                        -
                        
                          λ
                          i1
                        
                      
                    
                  
                  
                    
                      
                        1
                        -
                        
                          λ
                          i2
                        
                      
                    
                  
                  
                    
                      ⋮
                    
                  
                  
                    
                      
                        1
                        -
                        
                          λ
                          i5
                        
                      
                    
                  
                
                ]
              
            
          
        
      
    
    
      
        (
        21
        )
      
    
  




Step 3

Map the contiguous input training data through the delay units (22) and filter structure (24) to obtain a set of training state vectors {X(k)|k=1, . . . , T}. Then find a vector c that provides the best linear mapping of the states to the corresponding target outputs {Y(k)|k=1, . . . , T}. One way of doing this is to use the Partial Least Squares method that is well known to those skilled in the art. This results in a multi-input, single-output (MISO) state space system {A, b, cT} in which equations (19), (20), and (21) are supplemented by the equation:

y(k)=cTx  (22)

where 



  
    
      
        
          c
          =
          
            [
            
              
                
                  
                    c
                    1
                  
                
              
              
                
                  
                    c
                    2
                  
                
              
              
                
                  ⋮
                
              
              
                
                  
                    c
                    N
                  
                
              
            
            ]
          
        
        ,
        
           
        
        ⁢
        
          
            c
            i
          
          =
          
            [
            
              
                
                  
                    c
                    i1
                  
                
              
              
                
                  
                    c
                    i2
                  
                
              
              
                
                  ⋮
                
              
              
                
                  
                    c
                    i5
                  
                
              
            
            ]
          
        
      
    
    
      
        (
        23
        )
      
    
  




Step 4

Balance each subsystem {Ai, bi, ciT} of the MISO block diagonal system based on controllability & observability theory. The balancing procedure allows order reduction of a state space system by transforming the states so that the controllability and observability properties of the original system are substantially concentrated in the first part of the state vector.
For each input variable, indexed by i, perform the balancing procedure on the sub-system {Ai, bi, ciT}. Balancing of a linear state space system is a method of reduction well known to those skilled in the art. Other methods of model reduction, such as Hankel reduction, can be substituted. A summary of the balancing method is now given.
For each sub-system {Ai, bi, ciT}, compute the controllability and observability Gramians Pi>0, Qi>0 that satisfy the equations:

AiPiAiT−Pi=−bibiT

AiTQiAi−Qi=−ciciT  (24)

Find a matrix Ri, using the Cholesky factorization method, such that

Pi=RiTRi.  (25)

Using the singular value decomposition method, diagonalize to obtain the following decomposition:

RiQiRiT=UiΣi2UiT  (26)

Define

Ti−1=RiTUiΣi−1/2  (27)

then

TiPiTiT=(TiT)−1QiTi−1=Σi  (28)

and the balanced subsystem is obtained through a similarity transform on the states as:

Âi=TiAiTi−1,{circumflex over (b)}i=Tibi,ĉiT=ciTTi−1  (29)

Step 5

Using balanced subsystems find out dominant time constant for each input by reducing each balanced model to a first order model. This is done by considering the dynamics of all but the first state of each input's filter unit (24) to have reached steady state. This leads to: 



  
    
      
        
          
            T
            i
          
          =
          
            -
            
              
                Δ
                ⁢
                
                   
                
                ⁢
                t
              
              
                ln
                ⁡
                
                  (
                  
                    a
                    i
                  
                  )
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        where
      
    
    
      
        (
        30
        )
      
    
  
  
    
      
        
          
            a
            i
          
          =
          
            
              
                a
                ^
              
              i11
            
            +
            
              
                
                  
                    
                      a
                      ^
                    
                    i12
                    T
                  
                  ⁡
                  
                    (
                    
                      I
                      -
                      
                        
                          A
                          ^
                        
                        i22
                      
                    
                    )
                  
                
                
                  -
                  1
                
              
              ⁢
              
                
                  a
                  ^
                
                i21
              
            
          
        
        ⁢
        
          

        
        ⁢
        and
      
    
    
      
        (
        31
        )
      
    
  
  
    
      
        
          
            A
            ^
          
          i
        
        ≡
        
          [
          
            
              
                
                  
                    a
                    ^
                  
                  i11
                
              
              
                
                  
                    a
                    ^
                  
                  i12
                  T
                
              
            
            
              
                
                  
                    a
                    ^
                  
                  i21
                
              
              
                
                  
                    A
                    ^
                  
                  i22
                
              
            
          
          ]
        
      
    
    
      
        (
        32
        )
      
    
  




Check the convergence of the dominant time constant estimation:

If 



  
    
      
        
          
            1
            N
          
          ⁢
          
            
              
                ∑
                
                  i
                  =
                  1
                
                N
              
              ⁢
              
                
                  (
                  
                    
                      a
                      1
                      current
                    
                    -
                    
                      a
                      i
                      previous
                    
                  
                  )
                
                2
              
            
          
        
        <
        ɛ
      
    
    
      
        (
        33
        )
      
    
  




or the number of iterations has exceeded the maximum allowable, go to step 6. Otherwise, return to step 2. The maximum number of iterations and ε are parameters of the training method.

Step 6

Once an accurate estimate of the dominant time constant is available for each input variable, the eigenvalues {λisP|s=1, . . . , 5} of the controllability gramian {circumflex over (P)}i (equivalently the observability gramian) are calculated; these are always positive and real because the controllability gramian is positive definite. The final order Si of each filter unit (24) is then calculated such that 



  
    
      
        
          
            
              ∑
              
                s
                =
                1
              
              
                
                  S
                  i
                
                -
                1
              
            
            ⁢
            
              λ
              is
              P
            
          
          
            
              ∑
              
                s
                =
                1
              
              5
            
            ⁢
            
              λ
              is
              P
            
          
        
        <
        θ
        ≤
        
          
            
              ∑
              
                s
                =
                1
              
              
                S
                i
              
            
            ⁢
            
              λ
              is
              P
            
          
          
            
              ∑
              
                s
                =
                1
              
              5
            
            ⁢
            
              λ
              is
              P
            
          
        
      
    
    
      
        (
        34
        )
      
    
  




where θ is parameter of the training method and is a value less than 1, a good practical value being 0.95. This order represents the total number of states of an individual filter unit (24).

After determining the model order, truncate the Âi matrix so that just the first Si states are used; this truncation is done by selecting the upper left Six Si submatrix of Âi. Then calculate the Si eigenvalues of the truncated Âi matrix {λis|s=1, . . . , Si}. Now configure each filter unit (24) using the preferred first and second order subfilter configurations with the preferred couplings as shown in FIG. 5 through FIG. 8. Use a first order filter for each real eigenvalue. Use a second order filter for each pair of complex eigenvalues {λ, {overscore (λ)}}, where, in FIG. 7 (equation 7) or FIG. 8 (equation 8):
 a11=λ+{overscore (λ)}

a12=−λ{overscore (λ)}  (35)

The preferred ordering of these subfilter units is according to time-constant, with the fastest unit being the primary subfilter.

Another favored approach is to perform model reduction by initializing with Laguerre type filter units as described in section V.4.2, rather than the simple diagonal filter structure of FIG. 13. Sufficient quantity of Laguerre type filter units span the full range of dynamics in the process, and thus the iterative process described above is not needed. In fact a non-linear model reduction can be achieved by performing a linear model reduction on the linear system whose states are defined by the Laguerre filters and whose outputs are defined by pre-transformed values at the hidden layer of the neural net:

ξ1(k), . . . ,ξH(k)

V.3.4 Configuring the Non-Linear Analyzer

The configuration of the non-linear analyzer (26) is not a central aspect of this application. The non-linear analyzer (26) is trained to optimally map the outputs of the filter units (24) to the corresponding target output. Training of a neural net is described in detail in (Bishop, 95) for example. In one embodiment, the non-linear analyzer is replaced by apparatus for a constrained non-linear approximator disclosed in U.S. patent application Ser. No. 09/892,586 and herein incorporated by reference. In particular, page 33, lines 26-29, as filed in application Ser. No. 09/392,586 describes the additional calculations needed when the inputs to the non-linear approximator are filtered states.
V.4 Universality of the Prediction Device
The predictive device is shown, in this section, to be able to approximate any time invariant, causal, fading memory system (defined below). In order to prove this, some precise notation and definitions will be needed.
V.4.1 Notation and Definitions for Universality Proof
Let Z denote the integers, Z+ the non-negative integers and Z− the non-positive integers respectively. A variable u represents a vector or a sequence in accordance with the context, while u(k) represents a value of the sequence at the particular time k.
For any positive integer p>0, RN denotes the normed linear space of real N-vectors (viewed as column vectors) with norm |u|=max1≦i≦N|un|. Matrices are denoted in uppercase bold. Functions are denoted in italic lowercase if they are scalars and in bold if they are vector valued.
Let lN∞(Z) (respectively lN∞(Z+) and lN∞(Z−)), be the space of bounded RN-valued sequences defined on Z (respectively Z+ and Z−) with the norm:

∥u∥∞=supkεZ|u(k)|

For every decreasing sequence w:Z+→(0,1], 



  
    
      w
      ⁢
      
        :
      
      ⁢
      
        Z
        +
      
    
    →
    
      
        (
        
          0
          ,
          1
        
      
      ]
    
  
  ,
  
    
      
        lim
        
          k
          →
          ∞
        
      
      ⁢
      
        w
        ⁡
        
          (
          k
          )
        
      
    
    =
    0
  




define the following weighted norm:

∥u∥w=supkεZ−|u(k)|w(−k)

A function F:lN∞(Z−)→R is called a functional on lN∞(Z−), and a function I:lN∞(Z−)→l∞(Z) is called an operator. As a notational simplification the parentheses around the arguments of functionals and operators are usually dropped; for example, Fu rather than F[u] and Iu(k) rather than I[u](k).
Two specific operators are important. The delay operator defined by

Qdu(k)≡u(k−d)

and the truncation operator defined by 



  
    Pu
    ⁡
    
      (
      k
      )
    
  
  ≡
  
    {
    
      
        
          
            u
            ⁡
            
              (
              k
              )
            
          
        
        
          
            k
            ≤
            0
          
        
      
      
        
          0
        
        
          
            k
            >
            0
          
        
      
    
  




The following definitions make precise the terms used to characterize the class of systems approximated by the predictive device.
Time invariant: An operator I is time-invariant if QdI=IQd ∀dεZ.
Causality: I is causal if u(l)=v(l)∀l≦k →Iu(k)=Iv(k).
Fading Memory: I:lN∞(Z)→l∞(Z) has fading memory on a subset K−⊂lN∞(Z−) if there is a decreasing sequence 



  
    
      w
      ⁢
      
        :
      
      ⁢
      
        Z
        +
      
    
    →
    
      
        (
        
          0
          ,
          1
        
      
      ]
    
  
  ,
  
    
      
        lim
        
          k
          →
          ∞
        
      
      ⁢
      
        w
        ⁡
        
          (
          k
          )
        
      
    
    =
    0
  
  ,




such that for each u, vεK− and given ε>0 there is a δ>0 such that

∥u(k)−v(k)∥w<ε→|Iu(0)−Iv(0)|<δ

Every sequence u in lN∞(Z−)can be associated with a causal extension sequence uc in lN∞(Z) defined as: 



  
    
      u
      c
    
    ⁡
    
      (
      k
      )
    
  
  ≡
  
    {
    
      
        
          
            u
            ⁡
            
              (
              k
              )
            
          
        
        
          
            k
            ≤
            0
          
        
      
      
        
          
            u
            ⁡
            
              (
              0
              )
            
          
        
        
          
            k
            >
            0
          
        
      
    
  




and each time invariant causal operator I can be associated with a functional F on lN∞(Z−) defined by

Fu=Iuc(0)

The operator I can be recovered from its associated functional F via

Iu(k)=FPQ−ku  (36)

Then, I is continuous if and only if F is, so the above equations establish a one to one correspondence between time invariant causal continuous operators and functionals F on lN∞(Z−). In the next the definition of the Laguerre system is given. These can be configured in the general filter structure of FIG. 4 but also have important theoretical properties.

V.4.2 Laguerre Systems

The set of the Laguerre systems is defined in the complex z-transform plane as: 



  
    
      L
      s
      i
    
    =
    
      
        
          
            
              
                η
                i
              
            
            ⁢
            
              z
              
                
                  -
                  
                    d
                    i
                  
                
                +
                1
              
            
          
          
            z
            -
            
              a
              j
            
          
        
        ⁡
        
          [
          
            
              1
              -
              
                
                  a
                  j
                
                ⁢
                z
              
            
            
              z
              -
              
                a
                j
              
            
          
          ]
        
      
      s
    
  
  ,
  
     
  
  ⁢
  
    s
    =
    0
  
  ,
  1
  ,
  ...
  ⁢
  
     
  
  ,
  ∞
  ,
  
     
  
  ⁢
  
    i
    =
    1
  
  ,
  ...
  ⁢
  
     
  
  ,
  N




where:

    Lsi(z): is the Z transform of lsi(k), the s-th order system for the i-th input.
    ai: is the i-th input generating pole, such that |ai|<1. This pole is selected as 



  
    
      a
      i
    
    =
    
      1
      -
      
        
          Δ
          ⁢
          
             
          
          ⁢
          T
        
        
          T
          i
        
      
    
  
  ,




     where Ti is the dominant time constant for the i-th input variable.
    di: is the time delay associated with the i-th input variable.
    ηi: =1−ai2 


The whole set of Laguerre systems can be expressed in a state space form that shows a decoupled input form and therefore can be mapped to the general filter structure in FIG. 4. Each filter unit (24) is configured as a single structured {Ai,Bi} subfilter. The structure of Ai is a lower triangular matrix, and bi=[1 0 . . . 0]T.
The key point here is that the representation is decoupled by input. Balancing can be done to decrease the order of the Laguerre systems, and similarity transforms can be done on the Laguerre filters in order to simplify the configuration to utilize the preferred subfilter units. Similarity transformations do not affect the accuracy of the representation and so proving that the use of Laguerre filters decoupled by input approximate any time invariant, causal, fading memory system is equivalent to proving the preferred subfilter structure can approximate any such system. The balancing is a practical mechanism to reduce order without degrading performance.
V.4.3 Proof of Approximation Ability of Laguerre Systems
First some preliminary results are stated:
Stone-Weierstrass Theorem (Boyd, 1985)
Suppose E is a compact metric space and G a set of continuous functionals on E that separates points, that is for any distinct u, vεE there is a GεG such that Gu≠Gv. Then for any continuous functional F on E and given ε>0, there are functionals, 



  
    
      {
      
        
          G
          1
          1
        
        ,
        
          ...
          ⁢
          
             
          
          ⁢
          
            G
            
              S
              i
            
            1
          
        
        ,
        ...
        ⁢
        
           
        
        ,
        
          G
          1
          N
        
        ,
        
          ...
          ⁢
          
             
          
          ⁢
          
            G
            
              S
              N
            
            N
          
        
      
      }
    
    ⊆
    G
  
  ,
  
    S
    =
    
      
        ∑
        
          i
          =
          1
        
        N
      
      ⁢
      
        S
        i
      
    
  




and a polynomial p: RS→R, such that for all uεE

|Fu−p(G11u, . . . , GS11u, . . . , G1Nu, . . . , GSNNu)|<ε

The reason for the group indexing, which is not necessary for a general statement of the Stone-Weierstrass theorem, will become apparent in Lemma 2 when each block with a Laguerre operator. In addition, three lemmas are necessary before the theorem can be proved.

Lemma 1: K−≡{uεlN∞(Z−)|0<∥u∥≦c1}, is compact with the ∥•∥w norm.

Proof: Let u(p) be any sequence in K−. We will find a u(0)εK_ and a subsequence of u(p) converging in the ∥•∥w norm to u(0). It is well know that K− is not compact in lN∞(Z−) with the usual supremum norm ∥•∥∞ (Kolmogorov, 1980). For each l, let be K−[−l,0] the restriction of K− to [−l,0]. K−[−l,0] is uniformly bounded by c1 and is composed of a finite set of values, hence compact in lN∞[−l,0]. Since K−[−l,0] is compact for every l, we can find a subsequence u(pm) of u(p) and a u(0)εK−[−l,0] along which u(pm) converges: 



  
    
      
        
          
            sup
            
              
                -
                l
              
              ≤
              k
              ≤
              0
            
          
          ⁢
          
            
            
              
                
                  u
                  
                    (
                    
                      p
                      m
                    
                    )
                  
                
                ⁡
                
                  (
                  k
                  )
                
              
              -
              
                
                  u
                  
                    (
                    0
                    )
                  
                
                ⁡
                
                  (
                  k
                  )
                
              
            
            
          
        
        →
        
          
            0
            ⁢
            
               
            
            ⁢
            as
            ⁢
            
               
            
            ⁢
            m
          
          →
          ∞
        
      
    
    
      
        (
        37
        )
      
    
  




Now, let ε>0. Since w(k)→0 as k→∞, we can find m0>0 a such that w(m0)≦ε/c1.

Since u(pm), u(0)εK−, we have that 



  
    
      
        
          
            sup
            
              k
              ≤
              
                -
                
                  m
                  0
                
              
            
          
          ⁢
          
            
            
              
                
                  u
                  
                    (
                    
                      p
                      m
                    
                    )
                  
                
                ⁡
                
                  (
                  k
                  )
                
              
              -
              
                
                  u
                  
                    (
                    0
                    )
                  
                
                ⁡
                
                  (
                  k
                  )
                
              
            
            
          
          ⁢
          
            w
            ⁡
            
              (
              
                -
                k
              
              )
            
          
        
        ≤
        
          2
          ⁢
          
            c
            1
          
          ⁢
          
            w
            ⁡
            
              (
              
                m
                0
              
              )
            
          
        
        <
        ɛ
      
    
    
      
        (
        38
        )
      
    
  




Now from equation (37) we can find m1 such that 



  
    
      
        
          
            sup
            
              
                -
                
                  m
                  0
                
              
              <
              k
              ≤
              0
            
          
          ⁢
          
            
            
              
                
                  u
                  
                    (
                    
                      p
                      m
                    
                    )
                  
                
                ⁡
                
                  (
                  k
                  )
                
              
              -
              
                
                  u
                  
                    (
                    0
                    )
                  
                
                ⁡
                
                  (
                  k
                  )
                
              
            
            
          
        
        <
        
          ɛ
          ⁢
          
             
          
          ⁢
          for
          ⁢
          
             
          
          ⁢
          m
        
        >
        
          m
          1
        
      
    
    
      
        (
        39
        )
      
    
  




so by equation (38) and equation (39) we can conclude that

∥u(pm)−u(0)∥w<ε for m>m1

which proves that K− is compact.

Lemma 2. The set of functional {Gsi} associated to the discrete Laguerre Operators are continuous with respect to ∥•∥w norm, that is, given any ε>0 there exists a δ>0 such that

∥u−v∥w<δ→|Gsiu−Gsiv|<ε

Proof: Consider the functional Gsi(•) associated with the Laguerre operator Lsi(•).

Given ε>0, chose a δ>0 such that:

|ui−vi|w<δ→|Gsiui−Gsivi|<ε  (40)

This is possible due to the continuity of the one dimensional Laguerre operators with respect to the weighted norm as shown in (Sentoni et al, 1996). Therefore, from equation (40) and the definition of the functionals

∥u−v∥w<δ→|ui−vi|w<δ→|Gsiu−Gsiv|=|Gsiui−Gsivi|<ε  (41)

which proves Lemma 2

Lemma 3. The {Gsi} separate points in lN∞(Z−), that is, for any distinct u, vεlN∞(Z−) there is a GsiεG such that Gsiu≠Gsiv.

Proof. Suppose u, vεlN∞(Z−) are equal except for the i-th component. Then

Gsiu≠Gsiv⇄Gsiui≠Gsivi  (42)

by the definition of the functionals. It is known from one dimensional theory (Sentoni et al, 1996) that for any distinct ui, viεl∞(Z−) there is a Gsi such that Gsiui≠Gsivi; this result together with equation (42) proves Lemma 3.

Approximation Theorem

Now given ε>0, Lemmas 1, 2, 3 together with the Stone-Weierstrass theorem imply that given any continuous functional F on K−, there is a polynomial p: RS→R. such that for all uεK−

|Fu−p(G11u, . . . , GS11u, . . . , G1Nu, . . . , GSNNu)|<ε  (43)

Because the Laguerre systems are continuous and acting on a bounded space, the Gsiu are bounded real intervals on so the polynomial p can be replaced by any static model that acts as a universal approximator on a bounded input space, for example, a neural net. In other words (43) can be replaced by

|Fu−NN(G11u, . . . , GS11u, . . . , G1Nu, . . . , GSNNu)|<ε  (44)

A time invariant causal operator I can be recovered from its associated functional through equation (36) as

Iu(k)=FPQ−ku

Now let uεK and kεZ, so PQ−kuεK−, hence

|FPQ−ku−NN(G11PQ−ku, . . . , GS11PQ−ku, . . . , G1NPQ−ku,. . . , GSNNPQ−ku)|<ε

Since the last equation is true for all kεZ, we conclude that for all uεK−

∥Iu−{circumflex over (I)}u∥<ε

In other words, it is possible to approximate any nonlinear discrete time invariant operator having fading memory on K, with a finite set of discrete Laguerre systems followed by a single hidden layer neural net. This completes the proof.
V.5 Equivalents
Although the foregoing details refer to particular preferred embodiments of the invention, it should be understood that the invention is not limited to these details. Substitutions and alterations, which will occur to those of ordinary skill in the art, can be made to the detailed embodiments without departing from the spirit of the invention. These modifications are intended to be within the scope of the present invention.

## Claims

1. A predictive device for modeling a non-linear, causal, multiple-input single-output system or process, comprising:
a plurality of preprocessing units for receiving a working signal including control data inputs, the preprocessing units normalizing the control data inputs, resulting in preprocessed inputs; 
a plurality of delay units coupled to the preprocessing units, the delay units time aligning the preprocessed inputs, resulting in time aligned inputs; 
a plurality of filter units coupled to the delay units, the filter units being of a substantially simplified configuration as compared to a configuration based upon discrete state space equations, the filter units filtering the time aligned inputs at least according to time, resulting in filtered states; 
a non-linear approximator coupled to the filter units and accepting the filtered states, the non-linear approximator generating a single approximator output; 
a postprocessing unit coupled to the non-linear approximator to receive the generated approximator output, the postprocessing unit converting the single approximator output to a single device output that represents a prediction of the output of the multiple-input single-output dynamic system being modeled by the device, and 
wherein the predictive device operates in a plurality of selectable modes including a configuration mode and multiple runtime modes that provide a generalized modeling of non-linear dynamic processes.

2. The device of claim 1 further comprising:
a device controller coupled to the preprocessing units for providing input thereto; and 
the single device output and other data generated by the predictive device, in any of the selectable modes, are received by the device controller for analysis, monitoring, optimization or control of the modeled process and/or the predictive device.

3. The device of claim 1 wherein the preprocessing units normalize the control data inputs by scaling and offsetting the control data inputs, resulting in preprocessed inputs.

4. The device of claim 1 wherein the postprocessing unit normalizes the approximator output by scaling and offsetting the approximator output, resulting in a postprocessed device output as the single device output.

5. The device of claim 1 wherein the plurality of selectable runtime modes includes a predictive mode in which:
(i) the predictive device receives a contiguous stream of control data inputs at asynchronous discrete base sample time; and 
(ii) the predictive device is operated once per base sample time.

6. The device of claim 5 wherein the contiguous stream of control data inputs is passed from a device controller and the approximator output is received by the device controller for analysis, monitoring, optimization or control of the modeled process.

7. The device of claim 1 wherein the plurality of selectable runtime modes comprises an horizon mode in which the predictive device:
receives an externally defined sequence of trial future data inputs proceeding from a current prediction mode device state; 
is operated in response to this sequence of trial data inputs producing a corresponding sequence of at least filtered states, and possible other state information; and 
stores the filtered states and other state information for use in reverse horizon mode.

8. The device of claim 7 wherein the horizon mode is run one or more times between runs of the predictive device in the predictive mode.

9. The device of claim 7 wherein
a contiguous stream of external trial data inputs is passed to the predictive device from a device controller; and 
the predictions generated during horizon mode are received by the device controller for analysis, monitoring, optimization or control of the modeled process.

10. The device of claim 7 wherein the plurality of selectable runtime modes comprises a reverse horizon mode in which the predictive device uses
(i) the filtered states and other state information from a most recent horizon mode run, and 
(ii) an output path index indicating a point in a generated sequence of predictions to obtain the sensitivities of the predictive device to changes in the trial input data sequence used by the most recent horizon mode run, based upon running the predictive device backwards.

11. The device of claim 10 wherein the reverse horizon mode is run one or more times between runs of the predictive device in the predictive mode.

12. The device of claim 10 wherein
the predictive device sensitivities generated during reverse horizon mode are received by a device controller for analysis, monitoring, optimization or control of the modeled process.

13. The device of claim 10 wherein a device controller specifies the output path index.

14. The device of claim 1 wherein the plurality of filter units comprise:
first and/or second order subfilters.

15. A computer method for modeling a non-linear, causal, multiple-input single-output, system or process, comprising the steps of:
(a) receiving and normalizing a working signal including control data inputs, resulting in preprocessed inputs; 
(b) aligning the preprocessed inputs, resulting in time aligned inputs; 
(c) using a plurality of filter units, filtering the time aligned inputs, at least according to time, resulting in filtered states; 
(d) employing a non-linear approximator, generating an approximator output based upon the filtered states; and 
(e) converting the approximator output to a model output that represents a prediction of the output of the multiple-input single-output dynamic system being modeled by the method, in a manner that provides a general modeling of non-linear dynamic processes.

16. The method of claim 15 wherein the step of receiving includes receiving a contiguous stream of control data inputs from an external system, said data inputs representing measurements from the modeled process; and
further comprising the step of passing model output to an external system for analysis, monitoring, optimization or control of the modeled process.

17. The method of claim 15 wherein the plurality of filter units comprise:
first and/or second order subfilters.

18. The method of claim 15 wherein the normalizing step employs a scale and offset for each input.

19. The method of claim 15 wherein the converting step employs a scale and offset.

20. The method of claim 15 wherein, in a predictive mode, the step of receiving includes receiving a contiguous stream of control data inputs from an external system, said data inputs representing measurements from the modeled process;
said receiving of data inputs occurs once per base sample; and 
the steps (a) through (e) are performed once per base sample.

21. The method of claim 20 further comprising the step of passing the model output to the external system for analysis, monitoring, optimization or control of the modeled process.

22. The method of claim 15 wherein, in an horizon mode, steps (a) through (e) are iterated multiple times wherein, at each iteration, the filtered states and other state information are stored for later use.

23. The method of claim 22 further comprising the step of passing the model output at each iteration to an external device or method for analysis, monitoring, optimization or control of the modeled process.

24. The method of claim 22 wherein, in a reverse horizon mode, steps (a) through (e) are iterated multiple times in reverse order, wherein, at each iteration
the steps employ stored information; and 
calculating sensitivities of the model output for a specified iteration with respect to changes in the predictive mode received data input at each previous iteration, where said specified iteration is provided by an external system.

25. The method of claim 24 further comprising the step of passing the calculated sensitivities at each iteration to the external device or method for analysis, monitoring, optimization or control of the modeled process.