Abstract:
A method for the computer-assisted control and/or regulation of a technical system is provided. The method includes two steps, namely learning the dynamics of a technical system using historical data based on a recurrent neuronal network, and the subsequent learning of an optimum regulation by coupling the recurrent neuronal network to another neuronal network. The method can be used with any technical system in order to control the system in an optimum computer-assisted manner. For example, the method can be used in the control of a gas turbine.

Description:
CROSS REFERENCE TO RELATED APPLICATIONS 
       [0001]    This application is the US National Stage of International Application No. PCT/EP2007/064265, filed Dec. 19, 2007 and claims the benefit thereof. The International Application claims the benefits of German application No. 10 2007 001 025.9 DE filed Jan. 2, 2007, both of the applications are incorporated by reference herein in their entirety. 
     
    
     FIELD OF INVENTION 
       [0002]    The invention relates to a method for computer-aided control and/or regulation of the technical system and to a corresponding computer program product. 
       BACKGROUND OF INVENTION 
       [0003]    In the control of complex technical systems it is often desirable that the action to be carried out on the technical systems is selected such that an advantageous desired dynamic behavior of the technical system is obtained. The dynamic behavior can however often not be predicted in a simple manner in complex technical systems, so that appropriate computer-aided prediction methods are needed in order to estimate the future behavior of the technical system and to select suitable actions for regulation or control of the technical system accordingly. 
         [0004]    Nowadays the control of technical systems is often based on expert knowledge, i.e. the automatic regulation of the system is created on the basis that this expert knowledge. However approaches are also known in which technical systems are controlled with the aid of known methods of what is referred to as reinforcement learning, see document [2]. The known methods are however not generally applicable to any given technical systems and often do not supply sufficiently good results. 
       SUMMARY OF INVENTION 
       [0005]    The object of the invention is thus to create a method for computer-aided prediction of the dynamic behavior of a technical system, which is generally valid for application to any given technical systems and delivers good results. 
         [0006]    In the inventive method information is obtained about the dynamic behavior of the technical system for a number of points in time in each case by a state of the technical system and by an action carried out on the technical system, with each respective action leading at a respective point in time into a new state of the technical system at the next point in time. The technical system in this case can be designed in any given way so that the states can be any given measurable parameters of the technical system. The actions in this case are any given modifications to the technical system which are characterized by the modification of corresponding manipulated variables on the technical system. A state is preferably characterized here by a plurality of environmental and state variables, with each state variable representing a specific measured value of the technical system. The state is thus often a state vector. Similarly the action may comprise a plurality of manipulated variables to be modified which each form an entry in a corresponding action vector. 
         [0007]    In the inventive method in a first step the dynamic behavior of the technical system is modeled with a recurrent neural network with the aid of training data comprising known states and actions at a number of points in time. The recurrent neural network here is fowled by a least one input layer comprising the states of the technical system and the actions performed on the technical system at the number of points in time, at least one hidden recurrent layer comprising recurrent states and at least one output layer comprising the states of the technical system at the number of points in time. The recurrence in the neural network is produced in this case by the temporal development of the system which is reflected in the hidden layer by the coupling of the hidden states at different points in time. 
         [0008]    Subsequently in a second step and action selection rule is learned. The learning is undertaken in this case such that the recurrent neural network which was trained in a first step with the training data is coupled for a current and future points in time to a further neural network, with the further neural network comprising at least one input layer, at least one hidden layer comprising hidden states and at least one output layer. The input layer of the further neural network in this case comprises at a respective point in time at least one part of the hidden states of the recurrent neural network at the respective point in time and the output layer of the further neural network comprises at a respective point in time the action carried out on the technical system at the respective point in time. The further neural network thus assumes the task of optimum control of the technical system in respect of the future actions, taking account of the model dynamics of the technical system which was undertaken in the first step. 
         [0009]    In a preferred embodiment the action selection rule is learned in accordance with an evaluation function which takes into account one or more criteria in relation to the state of the technical system and/or the actions carried out on the technical system and/or which is learned in the step of modeling the dynamic behavior of the technical system. 
         [0010]    Finally in the inventive method with the recurrent neural network which is coupled to the further neural network and with which the action selection rule was learned, states of the technical system and/or actions, preferably optimum actions to be carried out on the technical system are determined. The technical system can then be regulated or controlled accordingly on the basis of the states or actions determined. It has been shown in this case that this type of network architecture makes possible data-efficient learning of the dynamic behavior of a technical system. Data efficiency is of great importance here since in most technical systems the available or relevant data material is greatly limited. In the specific description the inventive method has been compared with known learning methods, using the example of the cart pole problem, and it has been shown that the inventive method delivers very good results by comparison with the known methods. 
         [0011]    In an especially preferred embodiment a feed-forward network is used as the further neural network in the inventive method in which the neurons of the hidden layers are not coupled back in time. 
         [0012]    In a further variant of the invention the evaluation function will be selected such that it parameterizes an optimum dynamic behavior of the technical system. In this way, by the appropriate choice of the evaluation function, the optimum control of the technical system can be realized. In this case the evaluation function can for example be represented by a cost function to be optimized. 
         [0013]    As already explained above, the states and the actions of the technical system preferably feature a number of variables. Similarly the hidden states of the recurrent or of the further neural network preferably also consist of a number of hidden variables. In particular in this case the number of the hidden variables of a hidden state of the recurrent and/or of the further neural network is smaller than the number of the environment variables of a state of the technical system. The number of hidden states in this case is preferably selected such that the method on the one hand is efficient as regards data and on the other hand still delivers good results. 
         [0014]    In the modeling of the dynamic behavior of the technical system by the recurrent neural network, in the first step of the inventive method, in an especially preferred embodiment the error between the states defined by the recurrent neural network and the states of the training data is minimized. 
         [0015]    In an especially preferred embodiment the inventive method is used in order to model a non-linear dynamic behavior of a technical system with the method and/or to learn a non-linear action selection rule. 
         [0016]    In a further embodiment of the inventive method a back propagation method is employed for modeling the dynamic behavior of the technical system with the recurrent neural network in the first step of the method and/or for learning the action selection rule in the second step of the method. Such back propagation methods are sufficiently well known from the prior art and in particular the method described in the publication [1] is used here. 
         [0017]    The recurrent neural network with which the dynamic behavior of the technical system is modeled is preferably a network with dynamically consistent temporal unfolding, taking into consideration future states and actions, which is referred to as a recurrent neural network with dynamically consistent overshooting. In such a network of the actual predictions of the network are used in the output layer as a substitute for future inputs in the input layer. 
         [0018]    In an especially preferred embodiment of the inventive method the modeling of the technical system with the recurrent neural network is represented by the following equations: 
         [0000]    
       
         
           
             
               s 
               τ 
             
             = 
             
               tanh 
                
               
                 ( 
                 
                   
                     Ip 
                     τ 
                   
                   + 
                   
                     Da 
                     τ 
                   
                   + 
                   θ 
                 
                 ) 
               
             
           
         
       
       
         
           
             
               x 
               
                 τ 
                 + 
                 1 
               
             
             = 
             
               Cs 
               τ 
             
           
         
       
       
         
           with 
         
       
       
         
           
             
               p 
               τ 
             
             = 
             
               
                 As 
                 
                   τ 
                   - 
                   1 
                 
               
               + 
               
                 Bx 
                 τ 
               
             
           
         
       
       
         
           
             
               
                 ∑ 
                 t 
               
                
               
                   
               
                
               
                 
                   ∑ 
                   τ 
                 
                  
                 
                     
                 
                  
                 
                   
                     ( 
                     
                       
                         x 
                         τ 
                       
                       - 
                       
                         x 
                         τ 
                         d 
                       
                     
                     ) 
                   
                   2 
                 
               
             
             → 
             
               min 
               
                 A 
                 , 
                 B 
                 , 
                 C 
                 , 
                 D 
                 , 
                 θ 
               
             
           
         
       
     
         [0000]    with the range of values of τ comprising a predetermined number m of time steps before the time t and a predetermined number n of time steps after the time t;
 
with tε{m, . . . , T−n}, with T being the number of times for which training data is present;
 
with x τ  representing the state of the technical system determined by the recurrent neural network at time τ;
 
with x τ   d  representing the state of the technical system at a time τ in accordance with the training data;
 
with a τ  representing the action at time t;
 
with s τ  and p τ  representing the hidden state at time τ of the hidden layer of the recurrent neural network;
 
with I being the unity matrix and A, B, C, D being matrices to be determined and θ being a bias to be determined.
 
         [0019]    As a result the corresponding matrices A, B, C, D and the corresponding bias θ are determined with the equations, which are selected such that the quadratic error between predicted and actual states is minimized. 
         [0020]    In the second step finally the matrices A, B, C and D as well as the parameter θ are recorded, and the learning of the reward rule is then preferably undertaken with the aid of the following equations: 
         [0000]    
       
         
           
             
               s 
               τ 
             
             = 
             
               tanh 
                
               
                 ( 
                 
                   
                     Ip 
                     τ 
                   
                   + 
                   
                     Da 
                     τ 
                   
                   + 
                   θ 
                 
                 ) 
               
             
           
         
       
       
         
           
             
               R 
               
                 τ 
                 + 
                 1 
               
             
             = 
             
               
                 
                   Gh 
                    
                   
                     ( 
                     
                       Cs 
                       τ 
                     
                     ) 
                   
                 
                  
                 
                     
                 
                  
                 for 
                  
                 
                     
                 
                  
                 all 
                  
                 
                     
                 
                  
                 τ 
               
               &gt; 
               t 
             
           
         
       
       
         
           
             
               with 
                
               
                   
               
                
               
                 p 
                 τ 
               
             
             = 
             
               
                 As 
                 
                   τ 
                   - 
                   1 
                 
               
               + 
               
                 Bx 
                 τ 
               
             
           
         
       
       
         
           
             
               and 
                
               
                   
               
                
               
                 a 
                 τ 
               
             
             = 
             
               
                 
                   f 
                    
                   
                     ( 
                     
                       F 
                        
                       
                           
                       
                        
                       
                         tanh 
                          
                         
                           ( 
                           
                             
                               Ep 
                               τ 
                             
                             + 
                             b 
                           
                           ) 
                         
                       
                     
                     ) 
                   
                 
                  
                 
                     
                 
                  
                 for 
                  
                 
                     
                 
                  
                 all 
                  
                 
                     
                 
                  
                 τ 
               
               &gt; 
               t 
             
           
         
       
       
         
           
             
               
                 ∑ 
                 t 
               
                
               
                   
               
                
               
                 
                   ∑ 
                   
                     τ 
                     &gt; 
                     t 
                   
                 
                  
                 
                     
                 
                  
                 
                   c 
                    
                   
                     ( 
                     
                       R 
                       τ 
                     
                     ) 
                   
                 
               
             
             → 
             
               min 
               
                 E 
                 , 
                 F 
                 , 
                 b 
               
             
           
         
       
     
         [0000]    with G being a matrix and h a given activation function, which map the state x τ+1  of the technical system onto a state relevant for the cost function c(·) R τ+1 ;
 
with f being a given activation function;
 
with E and F being matrices to be determined and b being a bias to be determined.
 
         [0021]    As already mentioned, the functions f and h can be any given activation functions, in particular they can also represent the identity mapping. 
         [0022]    The inventive method can be employed for any given technical systems. One application is a turbine for example, especially a gas turbine. 
         [0023]    The technical system is controlled such that at the start of the control initially all steps of the inventive method except for the actual action selection step will be executed and subsequently the recurrent neural network coupled with the further neural network thus produced with learned action selection rules will be used to select the actions which are executed for control of the technical system. The control rules will thus be established once and not modified any further during the control of the technical system. 
         [0024]    Alternately it is possible, during the execution of the control of the technical system, for all steps of the inventive method are carried out at regular intervals (except for the actual action selection), with the new states and actions produced during the control being taken into consideration in the execution of these steps as new and/or further training data. After the execution of these steps of the inventive method the recurrent neural network coupled to the further neural network will then be used with the learned action selection rule for selecting further actions. In this way and online learning of the regulation is guaranteed during the control of the technical system. 
         [0025]    As well as the method described above, the invention further relates to a computer program product with program code stored on a machine-readable medium for executing the inventive method when the program runs on a computer. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0026]    Exemplary embodiments of the invention are explained in detail below with reference to the enclosed figures. 
           [0027]    The figures show: 
           [0028]      FIG. 1  a schematic diagram which shows the modeling of the technical system with a recurrent neural network in accordance with one exemplary embodiment of the invention; 
           [0029]      FIG. 2  a schematic diagram which reflects the learning of an action selection rule by the recurrent neural network of  FIG. 1  in combination with a feed-forward network in accordance with an exemplary embodiment of the invention; 
           [0030]      FIG. 3  a schematic diagram which shows the cart pole problem with which an exemplary embodiment of the inventive method has been tested; 
           [0031]      FIG. 4  a table which compares results of the inventive method for the cart pole problem with results of other methods; 
           [0032]      FIG. 5  and 
           [0033]      FIG. 6  diagrams which reproduce the results in accordance with the table from  FIG. 4  in the form of graphs. 
       
    
    
     DETAILED DESCRIPTION OF INVENTION 
       [0034]    The inventive method will be described in detail below. The method is able to be used here with any given type of technical system of which the dynamic behavior is able to be described by a state space X and an action space A with a (stochastic) transition function P (x t , a t , x t+1 ) In this case x t , x t+1  εX are states of the technical system at the times t or t+1, with each state being characterized by a plurality of state and environment variables. These environment variables in such cases are measurable state variables of the technical system, for example the gas pressure, the gas temperature, combustion chamber accelerations and the like in a gas turbine. The actions a t  εA are in this case modifications of manipulated variables of the technical system at time t which in their turn have an influence on later states of the technical system. Like the state x t , the action a t  can also comprise a plurality of action variables and an action can thus be characterized by the modification of a number of manipulated variables. An example of a manipulated variable able to be modified on a technical system is the setting of valves in a gas turbine. Often the technical systems are also designed so that the state space and the action space intersect, i.e. that a manipulated variable in the technical system also characterizes the state of the technical system. 
         [0035]    The above description of the technical system with the aid of a state space X, and actions space A and a stochastic transition function P corresponds to the Markov Decision Process (MDP) known from the prior art. It is thus assumed that the technical system can be described with such a process. A reward or cost function c: X×A→R exists for this process, with R representing a space of the rewards which the system receives for selecting an action a t  in state x t . The objective is now to determine an optimum rule Π:X→A which maximizes the expected accumulated or average reward function c for each state x t . The maximization of the reward function c corresponds in this case to a possible design of an action selection rule as is defined in the claims. The reward function is in particular defined so that it reflects desired characteristics of the technical system, with the optimum being reached when the function is at its maximum. In the simplest case the cost function could for example be an advantageous desired state of the technical system which is optimal when it exhibits its maximum value. It is assumed below that the technical system is a deterministic Markov Decision Process with discrete time steps, with the state spaces X and A being continuous. 
         [0036]    In accordance with the invention a Markov Decision Process is modeled with a recurrent neural network RNN, by which a mapping of the dynamic behavior of the technical system, i.e. of the transmission function P(•), is undertaken by a high-dimensional non-linear system equation. The recurrent neural network RNN used in the variant of the invention described here is shown in this case in  FIG. 1 . The recurrent neural network comprises an input layer I which shows the states and the actions at the individual times. For example the states x t  as well as the actions a t−1 , a t , a t+1  are reproduced in  FIG. 1 . The input layer is coupled to a hidden layer H via corresponding matrices B and D, which will be defined in greater detail below. The hidden layer features hidden states for each point in time, with  FIG. 1  showing the states p t−1 , s t−1 , p t , s t , p t+1  and s t+1  as typical examples. The hidden layer H is redundant in this case since the individual hidden states are coupled to each other, a fact which is reflected by corresponding matrices I (corresponds to the unity matrix) and A and also a bias θ in  FIG. 1 . The recurrent neural network of  FIG. 1  also features an output layer O which is foamed by the states of the technical system, with the states x t , x t+1  and x t+2  being reproduced in  FIG. 1 . These states are coupled in this diagram to the hidden states s t−1 , s t  and s t+1  by a matrix C in each case. 
         [0037]    The neural network according to  FIG. 1  is a neural network with dynamically consistent overshooting. This means that in the modeling of the neural network not only times ti in the past, but also times τ in the future will be taken into account and the own predicted states of the network will be used in the output layer as inputs for future states in the input layer. The parameter τ is restricted by the length of the previous unfolding m and the length of the so-called overshooting n, so that the following applies: τε{t−m, . . . , t+n} for all observed times tε{m, . . . , T−n}, with T representing the number of available times for which training data for learning the neural network is present. The overshooting is produced from  FIG. 1  by the fact that future times τ&gt;t are also taken into account in the modeling of the technical system by the neural network. Since these future times are not known, the states output via the network in the output layer will again also be used as input the next time step. This is shown in  FIG. 1  for point in time t+1 at which the output state x t+1  is once again fed to the hidden state p t+1  of the hidden layer. 
         [0000]    In the embodiment of the invention described here a sequence of states x τ  and actions a τ  is thus created on the input side of the recurrent neural network, with the network being unfolded temporally at a predefined interval which takes into account the past and the future. Mathematically the recurrent neural network of  FIG. 1  can be described by the following equations, with the above-mentioned matrices I, A, B, C, D as well as the bias θ being contained in the equations. 
         [0000]        s   τ =tan  h ( Ip   τ   +Da   τ +θ) 
         [0000]      x τ+1 =Cs τ   
         [0000]      with  p   τ   =As   τ−1   +Bx   τ   
         [0038]    The state pτ is referred to here as a pre-state which aggregates the information from a previously hidden state sτ−1 and from the external state xτ. The non-linearity in the hidden layer is expressed here with the tangens hyperbolicus. The pre-state pτ has the same dimension as the hidden state ST and is connected to the latter via the identity matrix I which will not be learned during the training of the neural network. The hidden state sτ has as its input an action at is used for calculation of the next expected state xz+1 of the technical system Matrix D is an additional matrix with suitable dimension which takes into account the influence of the actions at on the state ST. The actions at are also provided to the neural network RNN as future inputs (τ&gt;t) since they do not directly influence the dynamics of the technical system and are thus not to be learned by the network. To cover a plurality of possible states in the state space X of the technical system, the recurrent neural network for modeling the technical system should be modeled with training data in which the actions at are selected at random. Otherwise the learned dynamic can be dependent under some circumstances on a specific rule. 
         [0039]    The aim of the inventive method is now to combine a neural network of  FIG. 1  learned with training data with reinforcement learning for learning the above-mentioned optimum rule Π. This is achieved in accordance with the invention by the recurrent neural network of  FIG. 1  being combined with a further so-called control network, by which the above reward function c will be implemented in the neural network. 
         [0040]    In the embodiment described here the additional control network is a three-layer neural feed-forward network with an input layer, a hidden layer and an output layer. Even if further more complex topologies were possible, any given type of control function can be modeled with the model described here. Since the optimum action a τ  is to be predicted the control network will only be coupled to the recurrent neural network for times lying in the future (i.e. τ&gt;t). For the preceding temporal unfolding (i.e. τ&lt;t) the actions previously listed are used in the neural network. 
         [0041]      FIG. 2  shows the recurrent neural network coupled to the further feed-forward network which will subsequently be referred to as the RCCN (Recurrent Control Neural Network). The parts of the network which relate to the feed-forward network are shown by dashed lines in the figure. The control network uses as its input layer the hidden states P t , P t+1 , . . . , etc. which are coupled to a hidden layer R with corresponding states r t , r t+1  etc. The hidden states r τ  are coupled in this case to the states p τ  via a matrix E as well as a bias b, i.e. the following applies: 
         [0000]        r   τ =tan  h ( Ep   τ   +b ) 
         [0042]    The hidden states r τ  are further coupled via a matrix F to the future actions a τ  to be modeled. In addition there exists a matrix G, which couples future states X t+1 , X t+2  etc. to states R t+1 . R t+2  etc., with the latter being relevant states for the calculation rule. 
         [0043]    The inventive neural network RCNN must fulfill two different tasks On the one hand it must identify the dynamics of the underlying technical system and on the other it must achieve an optimum control of the technical system with the aid of a corresponding choice of actions or reward rules. The network is thus trained in two consecutive steps, namely a first step for learning the recurrent neural network with training data and a second step for learning a reward rule by coupling the recurrent neural network to a feed-forward network. This inventive approach differs from the conventional methods in which a combined learning of both tasks is attempted in one step. 
         [0044]    In the first step of the inventive method the dynamics of the underlying Markov Decision Process are first modeled, which correspond to the dynamic behavior of a technical system. The network RCNN will consequently be reduced to a recurrent neural network RNN with dynamically consistent overshooting. This first step is represented mathematically by the following equations: 
         [0000]    
       
         
           
             
               
                 
                   
                     s 
                     τ 
                   
                   = 
                   
                     tanh 
                      
                     
                       ( 
                       
                         
                           Ip 
                           τ 
                         
                         + 
                         
                           Da 
                           τ 
                         
                         + 
                         θ 
                       
                       ) 
                     
                   
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
             
               
                 
                   
                     x 
                     
                       τ 
                       + 
                       1 
                     
                   
                   = 
                   
                     Cs 
                     τ 
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
             
               
                 
                   
                     with 
                      
                     
                         
                     
                      
                     
                       p 
                       τ 
                     
                   
                   = 
                   
                     
                       As 
                       
                         τ 
                         - 
                         1 
                       
                     
                     + 
                     
                       Bx 
                       τ 
                     
                   
                 
               
               
                 
                   ( 
                   3 
                   ) 
                 
               
             
             
               
                 
                   
                     
                       ∑ 
                       t 
                     
                      
                     
                         
                     
                      
                     
                       
                         ∑ 
                         τ 
                       
                        
                       
                           
                       
                        
                       
                         
                           ( 
                           
                             
                               x 
                               τ 
                             
                             - 
                             
                               x 
                               τ 
                               d 
                             
                           
                           ) 
                         
                         2 
                       
                     
                   
                   → 
                   
                     min 
                     
                       A 
                       , 
                       B 
                       , 
                       C 
                       , 
                       D 
                       , 
                       θ 
                     
                   
                 
               
               
                 
                   ( 
                   4 
                   ) 
                 
               
             
           
         
       
     
         [0045]    The last equation in this case represents the task of training in which the result to be achieved is that a state x τ , which is defined by the current neural network, matches the state x τ   d  of the training data as well as possible. A minimization of the quadratic error in relation to the matrices A, B, C and D and the bias θ are undertaken, which represent the parameters of the recurrent neural network to be defined. 
         [0046]    After the first step of the modeling of the dynamics of the technical system, the matrices A, B, C and D defined in this step as well as the bias θ are recorded, i.e. their weights are not modified during further training. The matrices E and F as well as the bias b are now activated, which is shown in  FIG. 2 . These are the only parameters during the second step of learning the reward rules. In this learning step the recurrent neural network does not receive any future actions as external inputs but these actions are learnt with the feed-forward network taking into consideration the reward function. In addition for previous time steps τ&lt;t the output cluster x τ  are omitted since they are only needed for modeling the dynamics in the first step. For future time steps τ&gt;t of the network the error function in accordance with equation (4) is replaced by the reward or cost function c(•), which is specified further below in equation (9). This is achieved in the architecture by the additional reward cluster R τ  which is linked to the output clusters by a problem-specific fixed matrix G, which depends on the above-mentioned reward function c(•), as well as the possible activation function h within the output cluster X τ . Thus the reward function c(•) is encoded by the network RCNN within the neural architecture. This means that the reward cluster R τ  does not only have to be calculated on the basis of the output cluster x τ  but that it can also be described more generally, which also makes possible more complicated network architectures. For example the reward function can be explicitly learnt, which is especially helpful when c(•) is not known or is only specified incompletely. This can be achieved by a further additional three-layer neural network with the output of the RCNN as inputs. 
         [0047]    The weights of the feed-forward network are only adapted in accordance with the back-propagated reward of the reward clusters R τ  (τ&gt;t). This corresponds to the idea that the second step of learning the action selection rule not only serves to identify the dynamics but also only to learn a rule which maximizes the reward with the dynamics of the system already having been modeled beforehand. 
         [0048]    The second step of learning the reward rule can be reproduced mathematically by the following equations (5) to (9). In this step the matrices E and F as well as the bias b are learnt. The equations (5) to (9) are as follows: 
         [0000]    
       
         
           
             
               
                 
                   
                     s 
                     τ 
                   
                   = 
                   
                     tanh 
                      
                     
                       ( 
                       
                         
                           Ip 
                           τ 
                         
                         + 
                         
                           Da 
                           τ 
                         
                         + 
                         θ 
                       
                       ) 
                     
                   
                 
               
               
                 
                   ( 
                   5 
                   ) 
                 
               
             
             
               
                 
                   
                     R 
                     
                       τ 
                       + 
                       1 
                     
                   
                   = 
                   
                     
                       
                         Gh 
                          
                         
                           ( 
                           
                             Cs 
                             τ 
                           
                           ) 
                         
                       
                        
                       
                           
                       
                        
                       for 
                        
                       
                           
                       
                        
                       all 
                        
                       
                           
                       
                        
                       τ 
                     
                     &gt; 
                     t 
                   
                 
               
               
                 
                   ( 
                   6 
                   ) 
                 
               
             
             
               
                 
                   
                     with 
                      
                     
                         
                     
                      
                     
                       p 
                       τ 
                     
                   
                   = 
                   
                     
                       As 
                       
                         τ 
                         - 
                         1 
                       
                     
                     + 
                     
                       Bx 
                       τ 
                     
                   
                 
               
               
                 
                   ( 
                   7 
                   ) 
                 
               
             
             
               
                 
                   
                     and 
                      
                     
                         
                     
                      
                     
                       a 
                       τ 
                     
                   
                   = 
                   
                     
                       
                         f 
                          
                         
                           ( 
                           
                             F 
                              
                             
                                 
                             
                              
                             
                               tanh 
                                
                               
                                 ( 
                                 
                                   
                                     Ep 
                                     τ 
                                   
                                   + 
                                   b 
                                 
                                 ) 
                               
                             
                           
                           ) 
                         
                       
                        
                       
                           
                       
                        
                       for 
                        
                       
                           
                       
                        
                       all 
                        
                       
                           
                       
                        
                       τ 
                     
                     &gt; 
                     t 
                   
                 
               
               
                 
                   ( 
                   8 
                   ) 
                 
               
             
             
               
                 
                   
                     
                       ∑ 
                       t 
                     
                      
                     
                         
                     
                      
                     
                       
                         ∑ 
                         
                           τ 
                           &gt; 
                           t 
                         
                       
                        
                       
                           
                       
                        
                       
                         c 
                          
                         
                           ( 
                           
                             R 
                             τ 
                           
                           ) 
                         
                       
                     
                   
                   → 
                   
                     min 
                     
                       E 
                       , 
                       F 
                       , 
                       b 
                     
                   
                 
               
               
                 
                   ( 
                   9 
                   ) 
                 
               
             
           
         
       
     
         [0049]    Both in the modeling of the dynamics of the technical system in accordance with the equation (1) to (4) and also in the learning of the reward rules in accordance with equations (5) to (9) the recurrent neural network will be trained with the same training patterns T and with a back propagation method sufficiently known from the prior art in accordance with publication [1]. Each training pattern T in this case corresponds to a point in time to which are assigned corresponding training data in the form of the state of the technical system and the action carried out at this point in time. The step of learning the reward rules can be viewed here as backwards propagation of the error of the reward function c(•). 
         [0050]    The embodiment of the recurrent control neural network RCNN described above combines in an ideal manner the advantages of a recurrent neural network RNN with dynamic overshoots for identification of the dynamics with a three-layer neural control network for learning the reward rules. In this way a high approximation accuracy is reached and dynamic systems can also be controlled in a very data-efficient manner. In addition the system can be scaled in a simple manner to higher dimensions and an only partially observable environment of states of the technical system can be reconstructed. In addition very good continuous state spaces and action spaces can be processed with the network. 
         [0051]    The above embodiment of the recurrent neural network has been tested using the example of the cart pole problem sufficiently known in the prior art. The cart pole problem is depicted here in  FIG. 3 . It consists of a cart  1  which is moving in a horizontal direction in a hollow  2  which is delimited by vertical walls  2   a . The position of the cart is described in this case in relation to the center of the hollow by the variable χ. The cart balances on its upper side a pole  3 , a position of which in relation to the vertical is described by the angle α. The system will thus be described by the following four variables at the corresponding times t=1, . . . , T: 
         [0000]    χ t :=Horizontal cart position
 
{dot over (χ)} t :=Horizontal cart speed
 
α t :=Angle between pole and the vertical
 
{dot over (α)} t :=Angular speed of the pole
 
         [0052]    The dynamics of this system is given by the following physical equations: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         [ 
                         
                           
                             
                               
                                 M 
                                 + 
                                 m 
                               
                             
                             
                               
                                 ml 
                                  
                                 
                                     
                                 
                                  
                                 cos 
                                  
                                 
                                     
                                 
                                  
                                 
                                   α 
                                   t 
                                 
                               
                             
                           
                           
                             
                               
                                 ml 
                                  
                                 
                                     
                                 
                                  
                                 cos 
                                  
                                 
                                     
                                 
                                  
                                 
                                   α 
                                   t 
                                 
                               
                             
                             
                               
                                 
                                   3 
                                   4 
                                 
                                  
                                 
                                   ml 
                                   2 
                                 
                               
                             
                           
                         
                         ] 
                       
                        
                       
                         [ 
                         
                           
                             
                               
                                 
                                   x 
                                   ¨ 
                                 
                                 t 
                               
                             
                           
                           
                             
                               
                                 
                                   α 
                                   ¨ 
                                 
                                 t 
                               
                             
                           
                         
                         ] 
                       
                     
                     - 
                     
                       [ 
                       
                         
                           
                             
                               m 
                                
                               
                                   
                               
                                
                               l 
                                
                               
                                 
                                   α 
                                   . 
                                 
                                 t 
                                 2 
                               
                                
                               sin 
                                
                               
                                   
                               
                                
                               
                                 α 
                                 t 
                               
                             
                           
                         
                         
                           
                             
                               mgl 
                                
                               
                                   
                               
                                
                               sin 
                                
                               
                                   
                               
                                
                               
                                 α 
                                 t 
                               
                             
                           
                         
                       
                       ] 
                     
                   
                   = 
                   
                     [ 
                     
                       
                         
                           
                             F 
                             . 
                           
                         
                       
                       
                         
                           0 
                         
                       
                     
                     ] 
                   
                 
               
               
                 
                   ( 
                   10 
                   ) 
                 
               
             
           
         
       
     
         [0053]    Here M is the mass of the cart  1  and m the mass of the pole  3 . 1 corresponds to half the length of the pole, g is the gravitational acceleration and F is the force which is exerted on the cart in the horizontal direction. This force is also shown in  FIG. 3 . 
         [0054]    The object of the cart pole problem is to balance the pole on the cart for the longest possible sequence of time steps without the cart hitting against the walls  2   a . Possible actions are the displacement of the cart to the left or to the right with a constant force F. In accordance with the original cart pole problem the system was penalized with a negatively reinforcing signal if the cart touched one of the walls  2   a  or if the pole is tilted by more than 12°. In all other cases a reward of zero was awarded. The cart pole problem has been fully solved by known reinforcement learning methods but a large amount of training data was required for this in said methods. The solution of the cart pole problem on the basis of the inventive network RCNN is described below. A recurrent neural network with dynamically consistent overshoots has been used in this case with 10 steps having been unfolded in the past and 30 steps in the future. On the one hand this gives the network a memory which is sufficient to identify the dynamics of the system and on the other hand the network is given a future surplus which allows it to predict the consequences of selected actions. The dimension for the states of the hidden layer in the recurrent neural network was set to 20 neurons and the dimension for the hidden layer R of the control network was fixed at 40 neurons. As already described above the tangens hyperbolicus was used as an activation function of the cluster a r  (see equation (8)). This restricted the action space of the network RCNN to [−1.1]. 
         [0055]    For learning by the recurrent neural network data of different sizes was generated in accordance with the equation (10), with the actions (i.e. the force F) having been selected at random. A function was selected as a cost function which reflects the above objective of avoiding a tipping of the pole or of the cart hitting the walls  2   a . The reward function was selected as follows: 
         [0000]    
       
         
           
             
               
                 
                   c 
                   = 
                   
                     
                       ∑ 
                       t 
                     
                      
                     
                         
                     
                      
                     
                       
                         ∑ 
                         
                           r 
                           &gt; 
                           t 
                         
                       
                        
                       
                           
                       
                        
                       
                         - 
                         
                           
                             ( 
                             
                               
                                 g 
                                 · 
                                 
                                   χ 
                                   τ 
                                 
                               
                               + 
                               
                                 α 
                                 τ 
                               
                             
                             ) 
                           
                           2 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   11 
                   ) 
                 
               
             
           
         
       
     
         [0056]    In this case g is a scaling factor which balances the error values of the two variables χ τ  and α τ ·g=0.1 was set in this case. Accordingly the matrix G was produced by equation (6) as follows: 
         [0000]    
       
         
           
             
               
                 
                   G 
                   = 
                   
                     [ 
                     
                       
                         
                           
                             0 
                             , 
                             1 
                           
                         
                         
                           0 
                         
                         
                           0 
                         
                         
                           0 
                         
                       
                       
                         
                           0 
                         
                         
                           0 
                         
                         
                           1 
                         
                         
                           0 
                         
                       
                     
                     ] 
                   
                 
               
               
                 
                   ( 
                   12 
                   ) 
                 
               
             
           
         
       
     
         [0057]    The identity function was used as activation function h according to equation (6). The recurrent neural network and also the feed-forward network were learned with the above-mentioned back propagation method in accordance with publication [1]. 
         [0058]    Discussed below are the results of the inventive method for resolving the cart pole problem compared to the results with other learning methods. 
         [0059]    The inventive neural network RCNN was trained with different training data. The reward rule learned thereby in accordance with equation (11) was tested for the cart pole problem with this test determining the number of steps N which corresponds to the number of steps for how long the pole  3  is balanced on the cart  1 , without the cart coming up against the walls  2   a . To learn the reward rules three sets of data were used in each case 300, 1000, 3000, 10,000, 30,000 and 100,000 training values. Subsequently for each data set size the median ME and the average AV of the steps N was determined over 100 different random initializations of the cart and the pole during the test. The median in this case with a concatenation of all determined numbers N in ascending order is the mean value in this order. The average is the arithmetic mean of all determined numbers N. A maximum number of steps N was defined as max=100,000 which provided enough values for the cart pole problem to be resolved in this test. 
         [0060]      FIG. 4  shows a table in which for the individual data set sizes, the median ME and the average AV for the inventive method with the network RCNN as well as for other known algorithms, namely the adaptive heuristic criticism algorithm AHC and the Q learning algorithm Q-L, are specified. It is known that the AHC delivers good results with the cart pole problem. The Q learning algorithm is a standard method for reinforcement learning. 
         [0061]    As emerges from the table depicted in  FIG. 4 , the inventive method with the neural network RCNN solves the cart pole problem very efficiently as regards data and markedly better than the other methods. In particular even with 1000 training values, the average number of steps for which the pole is balanced is very large, the number is around 33573. With one of the training data sets, even with a data set size of 1000, the reward rule could be learned. By comparison the AHC algorithm needs a data set size of at least 100,000 data values in order to find a good solution. The results of the Q learning method were even significantly worse and with this method the maximum number max of steps was not reached with any data set. By way of illustration the results of the table in  FIG. 4  are also shown once again graphically with a logarithmic scale in  FIG. 5  and  FIG. 6 . In  FIG. 5  the data set size DS is plotted along the abscissa and the median ME for the three learning methods is indicated along the ordinate, with the inventive method RCNN being reproduced as a solid line, the AHC method as a dotted line and the Q learning method as a dashed line. The diagram shown in  FIG. 6  corresponds to that shown in  FIG. 5  with a single difference that the average AV is now plotted along the ordinate. It can clearly be seen from the two  FIGS. 5 and 6  that the inventive method delivers better results than the prior art methods. 
         [0062]    Although the inventive method was only tested in relation to the cart pole problem, it is not just restricted to this problem. It can especially be used with any given technical system in which given types of states can be measured and in which given types of actions can be carried out in the form of modification of manipulated variables. 
       LITERATURE REFERENCES 
       [0000]    
       
         [1] D. E. Rumelhart, G. E. Hinton, and R. J. Williams, “Learning internal representations by error propagation”, in  Parallel Distributed Processing: Explorations in The Microstructure of Cognition , D. E. Rumelhart and J. L. M. et al., Eds. Cambridge: MIT Press, 1986, vol. 1, pp. 318-362 
         [2] Leslie Pack Kaelbling; Michael L. Littman; Andrew W. Moore, Reinforcement Learning: A Survey, Journal of Artificial Intelligence Research 4 (1996) pp. 237-285