Patent Publication Number: US-2021178600-A1

Title: System and Method for Robust Optimization for Trajectory-Centric ModelBased Reinforcement Learning

Description:
FIELD OF INVENTION 
     This invention generally relates to system and method for simultaneously optimizing a local policy and control trajectory for trajectory-centric Reinforcement Learning. 
     BACKGROUND OF THE INVENTION 
     Reinforcement Learning (RL) is a learning framework that handles sequential decision-making problems, wherein an ‘ agent’ or decision maker learns a policy to optimize a long-term reward by interacting with the (unknown) environment. At each step, an RL agent obtains evaluative feedback (called reward or cost) about the performance of its action, allowing it to improve (maximize or minimize) the performance of subsequent actions. 
     In general, global learning and optimization for arbitrary non-linear systems could be extremely challenging both computationally and algorithmically. However, a lot of tasks that a lot of systems need to perform are trajectory-centric and thus, a local learning and optimization could be very data-efficient. Trajectory-centric control could be challenging for a the non-linear system due to the time-varying nature of the controller. It is very common for a real system to deviate from the planned trajectory during operation due to an incorrect model or noise in observation or actuation. A machine learning method allows to learn and then predict the uncertainty in the evolution of a controlled trajectory. It is desirable, from a control perspective, to design a local state-dependent policy that can stabilize a controlled trajectory using the learned uncertainty model. Most of the techniques can&#39;t use the knowledge of the uncertainty present in the system model to allow stabilization of a desired control trajectory. 
     It is also desirable that the trajectory and the corresponding stabilizing policy be designed simultaneously. This will naturally strike a trade-off between the optimality of the control trajectory and its stabilization. Intuitively in such a setting, a policy optimization algorithm will avoid regions of state-space which might be harder to control and thus, can exploit the uncertainty in the model to design robust-optimal trajectory-centric controllers. Most of the current techniques perform these two steps (trajectory design and controller synthesis) separately and thus, can&#39;t exploit such knowledge of model uncertainty. 
     In the light of above-mentioned facts and challenges, there is a requirement of better policy optimization methods that can use the uncertain statistical models of physical systems and exploit the structure of these models for robust performance of these systems across a wide range of tasks. 
     SUMMARY OF THE INVENTION 
     Recent research has resulted in remarkable success of these algorithms in various domains like computer games. In trajectory-centric RL, the goal is to optimize a policy that can successfully perform a task from an initial state of the system and guide the system to desired final state(s). The trajectory-centric methods have the advantage that they can learn faster as these methods learn local predictive models and these use them to optimize policies in a local neighborhood of the system. 
     Reinforcement learning algorithms can be broadly divided into two categories—Model-based methods and model-free methods. Model-based Reinforcement Learning (MBRL) techniques are generally considered to be data-efficient as they learn a task-independent predictive model for the system. The learned model is then used to synthesize policies for the system using stochastic control approaches. However, these methods are generally very hard to train and thus result in low-performance policies. There are several reasons for low performance obtained by these class of algorithms and one of the key challenges is that the predictive models for the system estimated during the learning process are inherently stochastic due to the noise present in data collected during learning process. As a result, a wrong model can drive the optimization algorithm to parts of state-space where the system is unstable and the learning process can then diverge. Another challenging aspect of MBRL is that an estimated model could have different levels of uncertainty in different regions of state-space and thus, the subsequently policy optimization step should exploit this structure of the learned statistical model for optimal performance. Most of the policy-optimization techniques either ignore or can&#39;t incorporate this information during policy optimization. 
     MBRL has the advantage is that the predictive models estimated during learning are task-agnostic and hence, they can be used for multiple tasks and thus, are more efficient in terms of learning across multiple tasks. Thus, MBRL allows re-use of learned models to compute policies for different tasks. As a result, MBRL has the potential to enable learning of efficient policies for a lot of physical systems where collecting lots of data for optimizing policies could be very expensive. 
     According to some embodiments of the present invention, policy optimization is performed using the uncertain statistical models of physical systems to exploit the structure of these models for robust performance of these systems across a wide range of tasks. Further, some embodiments provide a controller and method which can handle arbitrary non-linear systems by effectively performing both computation and the related learning algorithms. As a lot of tasks that a lot of systems need to perform are trajectory-centric, some embodiments of the present invention can provide a local learning and optimization that are very data-efficient, resulting in the improvement of computers (computer performances). 
     Some embodiments of the present disclosure are based on recognition that a computer-implemented learning method is provided for optimizing a control policy controlling a system. Some examples of such systems may be systems including mechanical systems like HVAC systems, factory automation systems, robotic systems, and high-performance induction motors, etc. In this case, the method may include receiving states of the system being operated by a task-specific policy; initializing the control policy as an initial guess for performing a task (e.g., known partial models for the system and task); collecting data which may include the tuple of current state, action and the next state using a current control policy; estimating a statistical predictive model for the system; estimating the predictions as well as uncertainties associated with the prediction at any state, control pair; estimating the local set around the nominal system state in which the system needs to be stabilized; computing the gradient of a robustness constraint which can be used to optimize the parameters of the local stabilizing policy; computing the gradient of the dynamics of the system; determining a trajectory-centric control policy by solving the non-linear optimization program to minimize the cost of the trajectory and the local stabilizing policy using the gradient of the robustness constraint. 
     Some embodiments provide method and system to perform a trajectory-centric task for a system in the presence of uncertainties of a statistical model estimated during learning. The controller for optimizing a local control policy of a system for trajectory-centric reinforcement learning may includes an interface configured to receive data including tuples of system states, control data and state transitions measured by sensors; a memory to store processor executable programs including a stochastic predictive learned model for generating a nominal state and control trajectory (an open-loop trajectory) for a desired time-horizon as a function of time steps, in response to a task command for the system received via the interface, a control policy including machine learning method algorithms and an initial random control policy, a local policy for regulating deviations along a nominal trajectory; at least one processor configured to: learn the stochastic predictive model for the system using a set of the data collected during trial and error experiments performed using the initial random control policy; estimate mean prediction and uncertainty associated with the stochastic predictive model; formulate a trajectory-centric controller synthesis problem to compute the nominal trajectory along with a feedforward control and a stabilizing time-invariant feedback control simultaneously; determine a local set of deviations of the system, using the learned stochastic system model, from a nominal system state upon use of a control input at a current time-step; determine a system state with a worst-case deviation from the nominal system state in the local set of deviations of the system; determine a gradient of the robustness constraint by computing a first-order derivative of the robustness constraint at the system state with worst-case deviation; determine the optimal system state trajectory, the feedforward control input and a local time-invariant feedback policy that regulates the system state to the nominal trajectory by minimizing a cost of a state-control trajectory while satisfying state and input constraints; provide and solve a robust policy optimization problem using non-linear programming; update the control data according to the solved optimization problem; and output the updated control data via the interface. 
     Furthermore, another embodiment of the present invention can provide a computer-implemented method (control system) for controlling a system by optimizing a control policy. The computer-implemented method is provided for optimizing a local control policy of a system for trajectory-centric reinforcement learning. The method may include steps of learning a stochastic predictive model for the system using a set of data collected during trial and error experiments performed using an initial random control policy; estimating mean prediction and uncertainty associated with the stochastic predictive model; formulating a trajectory-centric controller synthesis problem to compute a nominal trajectory along with a feedforward control and a stabilizing time-invariant feedback control simultaneously; determining a local set of deviations of the system, using the learned stochastic system model, from a nominal system state upon use of a control input at a current time-step; determining a system state with a worst-case deviation from the nominal system state in the local set of deviations of the system; determining a gradient of the robustness constraint by computing a first-order derivative of the robustness constraint at the system state with worst-case deviation; determining the optimal system state trajectory, the feedforward control input and a local time-invariant feedback policy that regulates the system state to the nominal trajectory by minimizing a cost of a state-control trajectory while satisfying state and input constraints; providing and solving a robust policy optimization problem using non-linear programming; updating the control data according to the solved optimization problem; and output the updated control data via the interface. 
     The system may include an interface configured to receive task commands and states of the system via sensors; a memory to store computer-executable programs including an initializer, a policy collector, an estimator, an agent and an policy-update program, a program to estimate the stochastic predictive model of the system, a program to compute a robustness constraint and its gradient, a program to solve the non-linear optimization problem to obtain the optimal trajectory and the stabilizing policy; and a processor, in connection with the memory, configured to initialize the control policy as an initial guess for performing a task (e.g., known partial models for the system and task); collecting data which may include the tuple of current state, action and the next state using a current control policy; estimating a statistical predictive model for the system; estimating the predictions as well as uncertainties associated with the prediction at any state, control pair; estimating the local set around the nominal system state in which the system needs to be stabilized; computing the gradient of a robustness constraint which can be used to optimize the parameters of the local stabilizing policy; computing the gradient of the dynamics of the system; determining a trajectory-centric control policy by solving the non-linear optimization program to minimize the cost of the trajectory and the local stabilizing policy using the gradient of the robustness constraint. 
    
    
     
       BRIEF DESCRIPTION OF DRAWINGS 
       The presently disclosed embodiments will be further explained with reference to the attached drawings. The drawings shown are not necessarily to scale, with emphasis instead generally being placed upon illustrating the principles of the presently disclosed embodiments. 
         FIG. 1A  is a diagram illustrating a control system (controller) for controlling a mechanical system (device, e.g., robots) based on the quasi-newton trust region policy optimization, according to embodiments of the present invention; 
         FIG. 1B  is a diagram illustrating a data processing flow using the controller (control system), according to embodiments of the present invention; 
         FIG. 2  is a diagram illustrating the general idea of reinforcement learning, according to the embodiments of the present disclosure; 
         FIG. 3  is a diagram illustrating an example of a system based on the proposed robust trajectory-centric controller optimization, according to embodiments of the present invention; 
         FIG. 4  is a diagram illustrating the idea of Model-based reinforcement learning, according to the embodiments of the present disclosure; 
         FIGS. 5A and 5B  are diagrams illustrating the estimation of a stochastic input-output relationship using Gaussian processes and the uncertainty sets that can be estimated using confidence intervals, according to the embodiments of the present disclosure; 
         FIG. 6A  is a diagram illustrating the idea of evolution of dynamics of a system using a stochastic process, according to the embodiments of the present disclosure; 
         FIG. 6B  is a diagram illustrating the idea of stabilization of a controlled trajectory using a stabilizing policy during the trajectory-centric controller design, according to the embodiments of the present disclosure; 
         FIG. 7  is a flowchart illustrating the different steps involved in solution of the non-linear optimization program used to solve the trajectory-centric controller, according to the embodiments of the present disclosure; 
         FIG. 8  is a flowchart illustrating the different steps to estimate the gradient of the robustness constraint for the trajectory-centric controller synthesis, according to the embodiments of the present disclosure; 
         FIG. 9  is a diagram illustrating an example for the stabilizing behavior of the designed controller, according to the embodiments of the present disclosure; 
         FIGS. 10A, 10B and 10C  are a diagram illustrating an example for the control trajectory and the stabilizing policy obtained during the optimization process, according to the embodiments of the present disclosure; 
         FIG. 11  is a diagram illustrating an example for the statistical behavior of the controlled system under various levels of disturbance injected into the system, according to the embodiments of the present disclosure; 
         FIG. 12  is a diagram illustrating an example for a ball-and-beam system 
         FIG. 13  is a diagram illustrating an example of performance comparison of the ball-and-beam system using the proposed trajectory-centric controller over the open-loop control, according to the embodiments of the present disclosure. 
     
    
    
     DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS 
     The following description provides exemplary embodiments only, and is not intended to limit the scope, applicability, or configuration of the disclosure. Rather, the following description of the exemplary embodiments will provide those skilled in the art with an enabling description for implementing one or more exemplary embodiments. Contemplated are various changes that may be made in the function and arrangement of elements without departing from the spirit and scope of the subject matter disclosed as set forth in the appended claims. 
     Specific details are given in the following description to provide a thorough understanding of the embodiments. However, understood by one of ordinary skill in the art can be that the embodiments may be practiced without these specific details. For example, systems, processes, and other elements in the subject matter disclosed may be shown as components in block diagram form in order not to obscure the embodiments in unnecessary detail. In other instances, well-known processes, structures, and techniques may be shown without unnecessary detail in order to avoid obscuring the embodiments. Further, like reference numbers and designations in the various drawings indicated like elements. 
     Also, individual embodiments may be described as a process, which is depicted as a flowchart, a flow diagram, a data flow diagram, a structure diagram, or a block diagram. Although a flowchart may describe the operations as a sequential process, many of the operations can be performed in parallel or concurrently. In addition, the order of the operations may be re-arranged. A process may be terminated when its operations are completed, but may have additional steps not discussed or included in a figure. Furthermore, not all operations in any particularly described process may occur in all embodiments. A process may correspond to a method, a function, a procedure, a subroutine, a subprogram, etc. When a process corresponds to a function, the function&#39;s termination can correspond to a return of the function to the calling function or the main function. 
     Furthermore, embodiments of the subject matter disclosed may be implemented, at least in part, either manually or automatically. Manual or automatic implementations may be executed, or at least assisted, through the use of machines, hardware, software, firmware, middleware, microcode, hardware description languages, or any combination thereof. When implemented in software, firmware, middleware or microcode, the program code or code segments to perform the necessary tasks may be stored in a machine-readable medium. A processor(s) may perform the necessary tasks. 
       FIG. 1A  shows a block diagram of a control system (controller)  100  according to some embodiments of the present invention. The system  100  can include a human machine interface (HMI) with input/output (I/O) interface  110  connectable with a keyboard  111  and a pointing device/medium  112 , a 3D sensor  116 , a processor  120 , a storage device  130  storing algorithms to be performed with a memory  140  and the processor  120 , a network interface controller  150  (NIC) connectable with a network  190  including local area networks and internet network (not shown), a display interface  160  connected to a display device  165 , an imaging interface  170  connectable with an imaging device  175 . The NIC may include a transceiver (not shown) to perform wireless communications for receiving commands and state measurement data. The HMI with I/O interface  110  may include analog/digital and digital/analog converters. The HMI with I/O interface  110  may also include a wireless communication interface that can communicate with other 3D point cloud display systems or other computers via wireless internet connections or wireless local area networks, which enable to construct multiple 3D point clouds. The system  100  can include a power source (not shown). The power source may be a battery rechargeable from an external power source (not shown) via the I/O interface  110 . Depending upon the application the power source may be located outside of the system  100 . 
     The system  100  can receive electric text/imaging documents  195  including speech data via the network  190  connected to the NIC  150 . The storage device  130  includes algorithm modules  131  including, the model uncertainty estimator, the robust constraint gradient evaluator and a non-linear optimization program solver are stored into the storage  130  as program code data, and robotic control algorithms  132 . The algorithms of model learning, robust constraint gradient estimator and the non-linear program optimizer  131  may be stored to a computer readable recording medium (not shown) so that the processor  120  can execute the algorithms of the models  131 - 132  and multimodal encoder-decoders  200  by loading the algorithms from the medium. Further, the pointing device/medium  112  may include modules that read and perform programs stored on a computer readable recording medium. 
       FIG. 1B  is a diagram illustrating a data processing flow using the controller (control system)  100 , according to embodiments of the present invention. Some embodiments of the present disclosure are based on the realization that a controller  100  for a machine  103  can be designed to achieve a particular command or task  101 . A controller  100  is a computer software that sends control signals to a machine  103  which implements the control signal and the state of the machine is observed by the observer  164 . Some embodiments of the disclosure are based on the realization that a Model-based Reinforcement Learning algorithm  105  can be used to learn an optimal policy for the controller  100  using operational data  104  obtained from the machine. For a particular task or command, the controller is initialized with an initial policy which determines a control signal based on the current state of the machine. The state of the machine can be observed by the observer. This control signal is then implemented on the machine and the state transition of the machine is observed. This tuple of current state, control signal and the next state is the data that is used by the learning algorithm to compute a new policy for executing the command or task. This process is then repeated till the policy converges to a stable policy (i.e, one that doesn&#39;t change up on collection of more data). 
       FIG. 2  is a diagram illustrating an example of a control system based on the proposed robust optimization for trajectory-centric RL, according to embodiments of the present invention. In the following, the control system is described as an example that are applied to a robotic system  200 , however it should be noted that a control system and a computer-implemented method according to the present invention are not limited to the robotic systems. Some systems or computer-implemented method according to the present invention can be introduced to systems including mechanical systems like HVAC systems, factory automation systems, robotic systems, and high-performance induction motors, etc. 
     The robotic system  200  in the  FIG. 2  may include a robotic manipulator equipped with sensors for state measurements and a computer-instrumented system for storing data and controlling the manipulator arm. The manipulator arm may include several rigid links  217 ,  215 ,  213  and joints  218 ,  216 ,  214 . The manipulator arm is controlled using a robot control system that receives a command or task that is externally supplied to the system. An example of the command or task could be grasping an object  212  using the manipulator or performing an assembly operation using the objects  211  held by the gripper  212 . The robot control system sends a control signal  270  to the manipulator. The control signal  270  could be the torques to be applied at each of the joints  218 ,  216 ,  214  of the manipulator and opening/closing of gripper  212 . The state of the robotic system is measured using sensors. These sensors may include encoders at the joints of the robot  218 ,  216 ,  214 , a camera  210  that can observe the environment of the robot and some tactile sensors  219  that can be attached to the jaws of the gripper  212 . The state measurements from sensors are sent to a data input/output unit  220  which stores the data received from the sensors. Some embodiments of the disclosure initialize the robot control system with an initial control policy for a desired task. Several episodes of the control policy are implemented on the robotic system and the state measurement data from the sensors is collected in a data input/output system  220 . This data is then used by a software containing a computer program  230  for updating the current policy of the robotic system. The program for updating the policy contains a model update system  240  which may be a Gaussian process. The models updated by  240  are then passed to the controller update system  250  which may be the robust trajectory-centric policy optimizer. The controller update system  250  then sends the updated policy to the robot control system  260 . This process is repeated till the optimal policy for control of the robot is reached. 
       FIG. 3  is a diagram illustrating the general idea of reinforcement learning, according to the embodiments of the present disclosure. Reinforcement Learning (RL) is a learning framework that handles sequential decision-making problems, wherein an ‘ agent’  230  or decision maker learns a policy to optimize a long-term reward (or cost) by interacting with the (unknown) environment  310 . At each step, an RL agent obtains evaluative feedback (called reward or cost)  350  about the performance of its action  340  along with an observation of the environment, allowing it to improve (maximize or minimize) the performance of subsequent actions. The policy for a system is defined as a function that takes the current state of a system as an input and then generates an action as an output. An optimal policy is a policy that generates the optimal output for every state of the system, where optimality is measured with respect to an expected reward (or cost) for a given task. 
     Reinforcement Learning algorithms are divided into two broad categories: model-free and model-based. As the name suggests, the model-free RL algorithms do not use the state-transition probability of a system to learn a policy. In these type of algorithms, the policy for a system is parameterized as a function approximator. The policy parameters are then optimized either directly by maximize the expected reward for performing the desired task or estimating a value function associated with the task. These algorithms are generally very sample inefficient, i.e., they take very large number of training data to optimize a policy for the system. Furthermore, learning using these systems is task-dependent, as the optimization is performed to maximize the expected reward for a particular task. 
     Among the different kind of RL algorithms, MBRL algorithms are considered to be more data efficient. In a model-based RL algorithm, an initial (possibly random) control policy is used to collect state-transition data from a system. This state-transition data is then used to learn a forward predictive model for the system. It is important to note that learning of the predictive model is independent of any task and thus, any reward structure. Once a good estimate of the forward dynamics of the system is obtained, the dynamics model of the system is used to synthesize a controller that can perform the desired task. A task could be performed could be performed using a controlled trajectory or a state-dependent full policy. A controlled trajectory is a sequence of control inputs that can be implemented on the system from a known initial condition to achieve the desired state to perform the task. It is noted that such a controller is not state-dependent but is rather time-indexed. A state-dependent full policy could be independent of the initial state of the system and thus can be used from any initial state of the system to perform the desired task. 
       FIG. 4  is a diagram illustrating the idea of Model-based reinforcement learning, according to the embodiments of the present invention. The MBRL method consists of a step  410  to first initialize the controller either randomly or it is computed using a partially known model of the system that needs to be controlled. In absence of any knowledge of the model for the system, the controller can be initialized randomly. The controller is run to collect the state transition data in step  420 , i.e., the tuple of (x k , u k , x k+1 ). The controller may be run in an episodic fashion where the system is first initialized to an initial state x init  and then the controller is run for ‘T’ time steps and the state transition data is collected. This episode may be repeated ‘n’ times until enough data is collected. In the next step  430 , this data is used to learn a predictive model for the system by minimizing a loss function which may be given by the following expression—∥x k+1 −ƒ(x k ,u k )∥ 2 . The function ‘ƒ’ may be represented by a machine learning algorithm like Gaussian processed or Neural Networks. The learned model in  430  is then passed to the next step  440  along with a cost function  460  which computes a policy or a controller for the system to perform a desired task. The cost function c(x k , u k ) contains the information about the desired task that the system needs to perform as a function of state and inputs. The obtained policy is then tested for convergence in step  450  and if the convergence criteria hasn&#39;t been met yet, the whole process is repeated. 
     It is object of some embodiments of the invention to estimate a statistical model for the system using the state transition data collected. Several machine learning methods can be used for this step including Gaussian processes or stochastic neural networks. Gaussian process is a stochastic process which is completely specified by a mean and covariance function. 
       FIGS. 5A and 5B  are diagrams illustrating the estimation of a stochastic input-output relationship using Gaussian processes and the uncertainty sets that can be estimated using confidence intervals, according to the embodiments of the present disclosure. 
     Gaussian process can be mathematically represented using the mean function, m(x) and the covariance function k(x, x′) of process ƒ(x) as follows: 
         m ( x )= E [ƒ( x )]
 
         k ( x,x ′)= E [(ƒ( x )− m ( x ))(ƒ( x ′)− m ( x ′))]
 
     and the Gaussian process is written as follows: 
       ƒ( x )˜ N ( m ( x ), k ( x,x ′)).
 
     Note that x here is the input to the Gaussian process and for the particular case of system dynamics estimation is the state-action pair (x k , u k ). The covariance function k(x, x′) is also known as the kernel function. There are several choices for a valid covariance function. Some of the most common choices are Radial Basis Function (RBF) kernel, the Matern kernel, the Squared exponential (SE) kernel, etc. Being a stochastic process, the Gaussian process is a collection of random variables, any finite collection of which are multi-variate Gaussian. After completion of the learning process from a training data set  511  D={X, Y}, the prediction at a test data point  512  x* is given by a Gaussian distribution (this can be shown using the property of multivariate Gaussian distribution). 
     Mathematically, it is represented by the following relationships. 
         p (ƒ( x *)| D,x *)= N (μ( x *),Σ( x *))
 
       μ( x *)= k   *   T ( K+σ   2   I ) −1   Y  
 
       Σ( x *)= k   **   −k   *   T ( K+σ   2   I ) −1   k   *  
 
     where, μ(x*) and Σ(x*) represent the mean and variance of the Gaussian distribution at the test data point x*. The learning process estimates the terms K, k **  and k * . Once these terms are estimated, the prediction at a new test data point is obtained using the closed form equations represented above in the equations. As a result, during the learning process, a probabilistic relationship  515  is learned for the desired input-output relationship between the current state-action pair and the next state transition. 
     Some embodiments of the invention are based on the realization that for an arbitrary non-linear system, synthesizing the full state-dependent policy for the system is a very challenging task computationally as well as numerically. This requires a reliable estimate of the global model of the system and is also a challenging problem to solve. On the other hand, computing a local controlled trajectory is an easier problem but it might have poor performance as it is very susceptible to initial conditions and is time-indexed. Furthermore, the performance might decrease in the presence of an incorrect, uncertain model. Thus to achieve good performance with a trajectory-centric controller, this invention proposes to use a stabilizing controller that can ensure high performance in presence of bounded uncertainties. 
     It is the object of some embodiments of the invention to use the learned model ƒ of the system to then design a robust-trajectory centric controller for the system. The trajectory-centric controller consists of the open loop state and control (x k , u k ) and the local stabilizing policy π θ  which are optimized jointly while minimizing the cost to perform the desired task for the system. This joint optimization is performed as an instance of non-linear program, which is explained next with first a brief introduction to trajectory introduction. 
     Consider the discrete-time dynamical system, 
         x   k+1 =ƒ( x   k   ,u   k )
 
     where x k ∈R n     x   , u k ∈R n     u    are the differential states and controls, respectively. The function ƒ: R n     x     +n     u   →R n     x    governs the evolution of the differential states. Note that the discrete-time formulation can be obtained from a continuous time system {dot over (x)}={circumflex over (ƒ)}(x, u) by using the explicit Euler integration scheme (x k+1 −x k )=Δt·{circumflex over (ƒ)}(x k , u k ) where Δt is the time-step for integration. 
     In typical applications the states and controls are restricted to lie in sets X={x∈R n     x   | x ≤x≤ x }⊆R n     x    and U={u∈R n     u   | u ≤u≤ū}⊆R n     u    i.e., x k  ∈X, u k  ∈U. We use [K] to denote the index set {0,1, . . . , K}. The trajectory optimization problem is to manipulate the controls u k  over a certain number of time steps [T−1] so that the resulting trajectory {x k } k∈[T]  minimizes a cost function c(x k , u k ). More formally, the trajectory optimization problem aims to solve the following optimization problem. 
     
       
         
           
             
               min 
               
                 
                   x 
                   k 
                 
                 , 
                 
                   u 
                   k 
                 
               
             
              
             
               
                 ∑ 
                 
                   k 
                   ∈ 
                   
                     [ 
                     T 
                     ] 
                   
                 
               
                
               
                 c 
                  
                 
                   ( 
                   
                     
                       x 
                       k 
                     
                     , 
                     
                       u 
                       k 
                     
                   
                   ) 
                 
               
             
           
         
       
     
     such that, 
     
       
         
           
             
               x 
               
                 k 
                 + 
                 1 
               
             
             = 
             
               f 
                
               
                 ( 
                 
                   
                     x 
                     k 
                   
                   , 
                   
                     u 
                     k 
                   
                 
                 ) 
               
             
           
         
       
       
         
           
             
               x 
               0 
             
             = 
             
               
                 x 
                 ~ 
               
               0 
             
           
         
       
     
     x k  ∈X, u k  ∈U for k ∈[T] 
     Some embodiments of the present disclosure are based on the realization that the above constrained trajectory optimization problem is a non-linear optimization program (or NLP). Consequently, it is the object of some embodiments to solve the non-linear trajectory optimization program using an interior point method. 
     In the following text, we use the following shorthand notation, ∥v∥ M   2 =v T Mv. We denote the nominal trajectory as X ≡x 0 , x 1 , x 2 , x 3 , . . . , x T-1 , X T , U≡u 0 , u 1 , u 2 , u 3 , . . . , u T-1 . The actual trajectory followed by the system is denoted as {circumflex over (X)}≡{circumflex over (x)} 0 , {circumflex over (x)} 1 , {circumflex over (x)} 2 , {circumflex over (x)} 3 , . . . , {circumflex over (x)} T-1 , {circumflex over (x)} T . We denote a local policy as π 0 , where π is the policy and θ denotes the parameters of the policy. The trajectory cost is also sometimes denoted as J=Σ k∈[T} c(x k ,u k ) 
     Sample efficiency of the MBRL techniques make it a very attractive option for learning optimal controllers for physical systems. Some embodiments of this invention are based on the realization that the performance of MBRL algorithms is extremely susceptible to modeling errors. Any error in the predictive model of the systems is compounded very quickly and can drive the controller to areas where the model is highly uncertain and thus, very hard to control. This can make the whole learning process to diverge and thus, fail. 
     Some embodiments of the invention are based on the realization that an optimizer can be constrained to avoid the uncertain regions of state-space of a system if the trajectory is solved simultaneously with a policy which is optimized to stabilize the trajectory locally. Such a joint optimization forces an optimization to find trajectories which easy to stabilize as well as optimal. Thus, it allows us to strike a trade-off between the optimality and robustness in the presence of uncertain models estimated during the learning process. This results in better, stable learning of the MBRL algorithms. 
     Some embodiments of the invention are based on the realization that a lot of trajectory-stabilizing techniques compute controller that are time-varying. This makes real-time control of the controlled system harder. In general, a RL algorithm computes a state-dependent policy as an output as it is easier to implement. The main reason being that the system is non-linear and thus the system dynamics change even with a small perturbation in the system states. The time-dependent tracking controllers are not state-dependent and thus, perform poorly in the scene of perturbation from the planned trajectory. Consequently, the current invention proposes to compute time-independent feedback policy for trajectory stabilization locally around a nominal trajectory. 
       FIG. 6A  is a diagram to illustrate evolution  610  of stochastic dynamics of system which may be represented by a Gaussian process. Given that the system is at an initial state  613  x k , and an input  611  u k , the system dynamics is represented by the stochastic function  612  ƒ(m(x), k(x, x′)). (Note that x here represents the input to the model, i.e., the pair (x k , u k ). 
     Consider the case where the system dynamics, ƒ is stochastic (i.e., it is defined by a mean and co-variance function), and only the mean component of ƒ is used to design the controller. Consider the deviation of the system at any step ‘k’ from the state trajectory X and denote it as δx k ≡x k −{circumflex over (x)} k . We introduce a local (time-invariant) policy π θ  that regulates the local trajectory deviation δx k  and thus, the final controller is denoted as û k =u k +π θ (δx k ). The closed-loop dynamics for the system under this control is then given by the following: 
         {circumflex over (x)}   k+1 =ƒ( {circumflex over (x)}   k   ,û   k )=ƒ( x   k   +δx   k   ,u   k +π θ (δ x   k ))
 
     The main objective is to find the time-invariant feedback policy π θ  that can stabilize the open-loop trajectory X locally within R k ∈R n     x    where R k  defines the set of uncertainty for the deviation δx k . The uncertainty region R k  can be approximated by fitting an ellipsoid to the uncertainty estimate using a diagonal positive definite matrix S k  such that R k ={δx k : δx k   T  S k  δx k ≤1}. The general optimization problem that achieves that is proposed as: 
     
       
         
           
             
               J 
               * 
             
             = 
             
               
                 min 
                 
                   X 
                   , 
                   U 
                   , 
                   θ 
                 
               
                
               
                 
                   E 
                   
                     
                       δ 
                        
                       
                         x 
                         k 
                       
                     
                     ∈ 
                     R 
                   
                 
                 [ 
                 
                   
                     
                       J 
                       ( 
                       
                         
                           X 
                           + 
                           
                             δ 
                              
                             
                                 
                             
                              
                             X 
                           
                         
                         , 
                         
                           U 
                           + 
                           
                             
                               π 
                               θ 
                             
                              
                             
                               ( 
                               
                                 δ 
                                  
                                 
                                   x 
                                   k 
                                 
                               
                               ) 
                             
                           
                         
                       
                       ] 
                     
                      
                     
                       
 
                     
                      
                     
                       X 
                       
                         k 
                         + 
                         1 
                       
                     
                   
                   = 
                   
                     
                       f 
                       ^ 
                     
                      
                     
                       ( 
                       
                         
                           x 
                           k 
                         
                         , 
                         
                           u 
                           k 
                         
                       
                       ) 
                     
                   
                 
               
             
           
         
       
     
     where {circumflex over (ƒ)}(⋅,⋅) denotes the mean function of the model. Note that in the above equation, we have introduced additional optimization parameters corresponding to the policy π θ  when compared to classical Trajectory Optimization problem introduced earlier. 
     Some embodiments of the present disclosure are based on the realization that a stochastic model for a system can be used to estimate the set of system states where the system might move from the nominal trajectory during run time. This estimate of the uncertainty sets gives us the set of states where the system needs to be stabilized during run-time. The goal of the stabilizing controller is push all the states in this set back to the original nominal trajectory. As long as this is true, the system can then follow the original nominal trajectory and thus can achieve the desired optimal performance in performing the desired task. 
     It is the object of some embodiment to estimate the uncertainty region R k  using a stochastic machine learning algorithm like Gaussian process regression or Stochastic neural network during the model learning process. As explained earlier, Gaussian processes may be used to learn the stochastic dynamics model for the system as a probabilistic function. 
     Some embodiment of the invention use this probabilistic relationship to estimate the confidence intervals using the predictive Gaussian distribution at a test data point. A confidence level a ∈( 0 , 1 ) is a user-chosen input that controls the size of the uncertainty set. This value is generally selected closer to 1 for worst-case controller design. 
       FIGS. 5A and 5B  indicate that the mean prediction value obtained by Gaussian process regression at a test point x*  512  is denoted by y(x*)  513  and the confidence interval  514 . The learned Gaussian process regression provides the mean prediction estimate 515 at any point as well as the confidence interval  516  at the same test point. As the expected force distribution at any point is given by a Gaussian distribution, the predicted state distribution at x* is shown in  520 . The mean value of predicted state  521  ( 513  in process  510 ) is y(x*) and the confidence interval is 522 (shown as  514  in process  510 ). 
     Further,  FIG. 6A  is a diagram illustrating the idea of evolution of dynamics of a system using a stochastic process and  FIG. 6B  is a diagram illustrating the idea of stabilization of a controlled trajectory using a stabilizing policy during the trajectory-centric controller design, according to embodiments of the present disclosure. 
     Some embodiments of the invention use this uncertainty region  630  estimated by the machine learning method to compute a stabilizing policy simultaneously with the trajectory  650 . The function of the stabilizing policy is to keep the system close to the nominal system states which is given by the trajectory. 
     The robust trajectory optimization problem is to minimize the trajectory cost while at the same time satisfying a robust constraint at every step along the trajectory. The purpose  620  of the local stabilizing controller is to push the state with worst-case deviation  640  at every step along the trajectory  650  to ε-tolerance balls  620  around the trajectory. Mathematically, we express the problem as following: 
     
       
         
           
             
               min 
               
                 
                   x 
                   k 
                 
                 , 
                 
                   u 
                   k 
                 
               
             
              
             
               
                 ∑ 
                 
                   k 
                   ∈ 
                   
                     [ 
                     T 
                     ] 
                   
                 
               
                
               
                 c 
                  
                 
                   ( 
                   
                     
                       x 
                       k 
                     
                     , 
                     
                       u 
                       k 
                     
                   
                   ) 
                 
               
             
           
         
       
     
     such that, 
     
       
         
           
             
               x 
               
                 k 
                 + 
                 1 
               
             
             = 
             
               
                 
                   f 
                    
                   
                     ( 
                     
                       
                         x 
                         k 
                       
                       , 
                       
                         u 
                         k 
                       
                     
                     ) 
                   
                 
                  
                 
                     
                 
                  
                 for 
                  
                 
                     
                 
                  
                 k 
               
               ∈ 
               
                 [ 
                 T 
                 ] 
               
             
           
         
       
       
         
           
             
               x 
               0 
             
             = 
             
               
                 x 
                 ~ 
               
               0 
             
           
         
       
       
         
           
             
               
                 x 
                 k 
               
               ∈ 
               X 
             
             , 
             
               
                 u 
                 k 
               
               ∈ 
               
                 U 
                  
                 
                     
                 
                  
                 for 
                  
                 
                     
                 
                  
                 k 
               
               ∈ 
               
                 [ 
                 T 
                 ] 
               
             
           
         
       
       
         
           
             
               max 
               
                 
                   δ 
                    
                   
                     x 
                     k 
                   
                 
                 ∈ 
                 
                   R 
                   k 
                 
               
             
              
             
                
               
                 
                   
                     x 
                     
                       k 
                       + 
                       1 
                     
                   
                   - 
                   
                     
                       f 
                       ( 
                       
                         
                           
                             x 
                             k 
                           
                           + 
                           
                             δ 
                              
                             
                               x 
                               k 
                             
                           
                         
                         , 
                         
                           
                             u 
                             k 
                           
                           + 
                           
                             
                               π 
                               θ 
                             
                              
                             
                               ( 
                               
                                 δ 
                                  
                                 
                                   x 
                                   k 
                                 
                               
                               ) 
                             
                           
                         
                       
                        
                     
                     2 
                   
                 
                 ≤ 
                 
                   ϵ 
                   k 
                 
               
             
           
         
       
     
     We define the last term in the above equation as the robustness constraint for the trajectory optimization problem. There are several features of this constraint that are worth mentioning. The above constraint acts on the trajectory at every point along the nominal trajectory, and it ensures that the local stabilizing policy π θ  pushes the worst-case deviation of the system state in the set R k  towards the nominal trajectory. Also, this allows a user how closely wants to follow the nominal trajectory by allowing to select a hyperparameter ϵ k . This hyperparameter can also be time-indexed. 
       FIG. 7  is a flowchart illustrating the different steps involved in solution of the non-linear optimization program used to solve the trajectory-centric controller, according to the embodiments of the present disclosure. The non-linear optimization program solver  710  accepts as input the known (learned or completely known) system dynamics  720 , the state and input set of the system  730 , the robustness constraint  740  and the desired task or the objective function  750 . The output provided by the non-linear optimization program solver is the optimal state input trajectory ({x k } k∈[T] , {u k } k∈[T] ) as well as the stabilizing policy π θ . 
     Some embodiments of the present invention are based on the realization that the robustness constraint leads to a sub-optimization problem inside of the main trajectory optimization problem. This requires estimating the term δx k  in the set R k  that incurs the maximum deviation under the action of a stabilizing policy π θ . Then, the robustness constraint is satisfied when such a point incurs a deviation less that the hyperparameter ϵ k . Finding solutions to the optimization problem for the robustness constraint for arbitrary non-linear dynamics ƒ is very challenging. However, the problem can be simplified by linearizing the dynamics of the system around the state-control pair (x k , u k ) and the linear dynamics can be used to find a local solution to the optimization problem inside the robustness constraint. 
     The robustness constraint for the linearized dynamics model can be obtained using Taylor series expansion for the non-linear dynamics model ƒ, and thus the robustness constraint term (call it d max ) can be simplified to the following term in the following. 
     
       
         
           
             
               d 
               
                 
                   ma 
                    
                   
                       
                   
                    
                   x 
                 
                 , 
                 k 
               
             
             = 
             
               
                 max 
                 
                   
                     δ 
                      
                     
                       x 
                       k 
                       T 
                     
                      
                     
                       S 
                       k 
                     
                      
                     δ 
                      
                     
                       x 
                       k 
                     
                   
                   ≤ 
                   1 
                 
               
                
               
                 
                    
                   
                     
                       
                         
                           A 
                            
                           
                             ( 
                             
                               
                                 x 
                                 k 
                               
                               , 
                               
                                 u 
                                 k 
                               
                             
                             ) 
                           
                         
                         · 
                         δ 
                       
                        
                       
                           
                       
                        
                       
                         x 
                         k 
                       
                     
                     + 
                     
                       
                         B 
                          
                         
                           ( 
                           
                             
                               x 
                               k 
                             
                             , 
                             
                               u 
                               k 
                             
                           
                           ) 
                         
                       
                       · 
                       
                         
                           π 
                           θ 
                         
                          
                         
                           ( 
                           
                             δ 
                              
                             
                               x 
                               k 
                             
                           
                           ) 
                         
                       
                     
                   
                    
                 
                 2 
               
             
           
         
       
     
     where, A(x k ,u k )=∇ x     k   {circumflex over (ƒ)}(x k ,u k ) and B(x k ,u k )=∇ u     k    {circumflex over (ƒ)}(x k ,u k ) are the linearized models for the mean function of the model {circumflex over (ƒ)}. 
     Certain embodiments of the current disclosure ae based on the realization that the robustness constraint on the optimization problem might need extensive tuning of the hyperparameter E k  to get a feasible solution (i.e., a solution that satisfies the constraint for all k∈[T]). In some cases, a feasible solution may not even be guaranteed. A possible solution to circumvent this possible situation to turn the hard robustness constraint into a soft constraint by adding to the objective function, and thus penalizing it everytime the constraint is violated. In the most simplest setting, the robustness term d max, k  can be just moved to the objective function and minimized during optimization. This relaxes the constraint for robustness while guaranteeing feasibility of the optimization problem. 
     Some embodiments of the invention may solve the following optimization problem using the robustness constraint as a soft constraint and moving it to the objective function. 
     
       
         
           
             
               min 
               
                 
                   x 
                   k 
                 
                 , 
                 
                   u 
                   k 
                 
                 , 
                 θ 
               
             
              
             
               ( 
               
                 
                   
                     ∑ 
                     
                       k 
                       ∈ 
                       
                         [ 
                         T 
                         ] 
                       
                     
                   
                    
                   
                     c 
                      
                     
                       ( 
                       
                         
                           x 
                           k 
                         
                         , 
                         
                           u 
                           k 
                         
                       
                       ) 
                     
                   
                 
                 + 
                 
                   β 
                    
                   
                       
                   
                   · 
                   
                     
                       ∑ 
                       
                         k 
                         ∈ 
                         
                           [ 
                           T 
                           ] 
                         
                       
                     
                      
                     
                       d 
                       
                         
                           m 
                            
                           
                               
                           
                            
                           ax 
                         
                         , 
                         k 
                       
                     
                   
                 
               
               ) 
             
           
         
       
     
     such that, 
     
       
         
           
             
               x 
               
                 k 
                 + 
                 1 
               
             
             = 
             
               
                 
                   f 
                    
                   
                     ( 
                     
                       
                         x 
                         k 
                       
                       , 
                       
                         u 
                         k 
                       
                     
                     ) 
                   
                 
                  
                 
                     
                 
                  
                 for 
                  
                 
                     
                 
                  
                 k 
               
               ∈ 
               
                 [ 
                 T 
                 ] 
               
             
           
         
       
       
         
           
             
               x 
               0 
             
             = 
             
               
                 x 
                 ~ 
               
               0 
             
           
         
       
       
         
           
             
               
                 x 
                 k 
               
               ∈ 
               X 
             
             , 
             
               
                 u 
                 k 
               
               ∈ 
               
                 U 
                  
                 
                     
                 
                  
                 for 
                  
                 
                     
                 
                  
                 k 
               
               ∈ 
               
                 [ 
                 T 
                 ] 
               
             
           
         
       
     
     Some embodiments of the present disclosure are based on the realization that in order to be able to solve the non-linear trajectory optimization with robustness constraint (either as a hard or soft constraint), there is a requirement of computation of gradient of the robustness constraint. The robustness constraint is, however, a non-differentiable due to the maximum function in the constraint which is non-differentiable. However, a first-order gradient of the robustness term can be obtained using the Dankin&#39;s theorem. This realization is critical to the solution of the trajectory optimization problem. Thus it is the object of certain embodiments to estimate the gradient of the robustness constraint using Danskin&#39;s theorem. 
     More formally, let K⊂R m  be a non-empty, closed set and let Ω⊆R n  be a nonempty, open set. Assume that the function g:Ω×K→R is continuous on Ω×K and that ∇ x g(x,y) exists and is continuous on Ω×K. Define the function h:Ω→R∪{∞} by: 
     
       
         
           
             
               
                 h 
                  
                 
                   ( 
                   x 
                   ) 
                 
               
               ≡ 
               
                 
                   sup 
                   
                     y 
                     ∈ 
                     K 
                   
                 
                  
                 
                   g 
                    
                   
                     ( 
                     
                       x 
                       , 
                       y 
                     
                     ) 
                   
                 
               
             
             , 
             
               x 
               ∈ 
               Ω 
             
           
         
       
     
     and, 
         M ( x )≡{ y∈K|h ( x )= g ( x,y )}.
 
     Let x ∈Ω be a given vector. Suppose that a neighborhood N(x) ⊆Ω of x exists such that M(x′) is nonempty for all x′∈N(x) and the set U x′∈N(x) M(x′) is bounded. Then according to Danskin&#39;s theorem following two statements are valid. 
     The function h is directionally differentiable at x and 
     
       
         
           
             
               
                 h 
                 ′ 
               
                
               
                 ( 
                 
                   x 
                   ; 
                   d 
                 
                 ) 
               
             
             = 
             
               
                 sup 
                 
                   y 
                   ∈ 
                   
                     M 
                      
                     
                       ( 
                       x 
                       ) 
                     
                   
                 
               
                
               
                 
                   ∇ 
                   x 
                 
                  
                 
                   
                     g 
                      
                     
                       ( 
                       
                         x 
                         , 
                         y 
                       
                       ) 
                     
                   
                   T 
                 
               
                
               d 
             
           
         
       
     
     If M(x) reduces to singleton, say M(x)={y(x)}, then h is Gaeaux differentiable at x and 
       ∇ h ( x )=∇ x   g ( x,y ( x ))
 
     Dankin&#39;s theorem allows us to find the gradient of the robustness constraint by first computing the argument of the maximum function and then evaluating the gradient of the maximum function at the point. 
     Thus, in order to find the gradient of the robust constraint, it is necessary to interpret it as an optimization problem in δx k , which is presented next. Some embodiments of the present disclosure are based on the realization that solution to the finding gradient of the robustness constraint in the general form could be very challenging. A simplification to the robustness constraint is obtained using by a linear parameterization of the stabilizing policy which allows to analytically compute the argument of the maximum function in the robustness constraint. This is very beneficial for computational requirements are it can be obtained analytically without any iterative optimization procedure. 
     Mathematically, we represent the stabilizing policy as time-invariant constant matrix W such that π θ (δx k )=W·δx k . Then the following realization lead us to estimate the argument of the maximum function in the robustness constraint. 
     The robustness constraint term d max,k  for the linear parameterization of the feedback policy is quadratic in the argument δx k . Mathematically, it is written as follows: 
                 max     δ        x   k                       M   k        δ        x   k            P   2       =       max     δ        x   k              δ        x   k   T            M   k   T     ·   P   ·     M   k          δ        x   k               such that, δ x   k   T   s   k   δx   k ≤1
 
       where,  M   k ( x   k   ,u   k   ,W )≡ A ( x   k   ,u   k )+ B ( x   k   ,u   k )· W  
 
     The resulting form of the worst-case deviation term d max, k  allows us to compute it analytically as the maximum eigenvalue λ max  of a matrix Q, where the matrix 
     
       
         
           
             Q 
             ≡ 
             
               
                 S 
                 k 
                 
                   - 
                   
                     1 
                     
                       
                           
                       
                       2 
                     
                   
                 
               
                
               
                 
                   M 
                   k 
                   T 
                 
                 · 
                 P 
                 · 
                 
                   
                     M 
                     k 
                   
                    
                   
                     ( 
                     z 
                     ) 
                   
                 
               
                
               
                 
                   S 
                   k 
                   
                     - 
                     
                       1 
                       2 
                     
                   
                 
                 . 
               
             
           
         
       
     
     The worst deviation δx max  is obtained as the corresponding eigenvector of the maximum eigenvalue. 
     The gradient of the robustness constraint d max, k  can be then obtained using Dankin&#39;s theorem as the gradient of the term at δx max . More explicitly, using a notation z for an arbitrary vector, and using 
     
       
         
           
             
               
                 Q 
                  
                 
                   ( 
                   z 
                   ) 
                 
               
               = 
               
                 
                   S 
                   k 
                   
                     - 
                     
                       1 
                       2 
                     
                   
                 
                  
                 
                   
                     
                       M 
                       k 
                       T 
                     
                      
                     
                       ( 
                       z 
                       ) 
                     
                   
                   · 
                   P 
                   · 
                   
                     
                       M 
                       k 
                     
                      
                     
                       ( 
                       z 
                       ) 
                     
                   
                 
                  
                 
                   S 
                   k 
                   
                     - 
                     
                       1 
                       2 
                     
                   
                 
               
             
             , 
           
         
       
     
     the gradient of the robustness constraint term d max  wrt to the arbitrary vector z can be computed as 
       ∇ z   d   max =∇ z   δx   max   T   Q ( z )δ x   max  
 
     This provides us the gradient of the robustness constraint term at a time-step ‘k’. It is the object of some embodiment to compute the gradient of the robustness constraint term at all k ∈[T]. 
       FIG. 8  is a flowchart illustrating the different steps to estimate the gradient of the robustness constraint for the trajectory-centric controller synthesis, according to the embodiments of the present disclosure. The estimate of the uncertainty region around a nominal state, action pair (x k , u k ) is computed by a module  810  which is then used in step  820  to compute the state with worst-case deviation in the uncertainty region. This worst-case deviation state is then used to compute the gradient of the robustness constraint by another embodiment in step  830 . The gradient information is then passed to the non-linear optimization program solver in step  840 . 
     The robust policy optimization problem can then be solved using the gradient of the robustness constraint as well as the gradient of dynamics of the system to obtain the optimal solution. Some embodiments of the invention use the cost function for the trajectory, the dynamics of the system, the robustness constraint using the uncertainty region for the system and the gradient information of the dynamics as well as the robustness constraint to solve the robust non-linear optimization program to simultaneously synthesize the open-loop trajectory X=x 1 , x 2 , . . . , x T , . . . , U=u 1 , u 2 , . . . , u T-1  and the local stabilizing policy π θ (δx k )=W·δx k . 
     Simulation tests are performed using non-linear systems to test and verify the benefits of the proposed robust trajectory-centric controller. In particular, can the feedback controller obtained by this optimization stabilize the open-loop trajectory in the presence of bounded uncertainties? An underactuated pendulum system is used to study this question. The objective is to demonstrate effectiveness of the solution in stabilization of the optimal trajectory and compare the feedback gains obtained via the optimization against time-varying LQR solution. The dynamics of the pendulum is modeled as I {umlaut over (θ)}+b {dot over (θ)}+mgl·sin(θ)=u. The continuous-time model is discretized as (θ k+1 , {dot over (θ)} k+1 )=ƒ((θ k , {dot over (θ)} k ), u_k). The goal state is x g =[π, 0], and the initial state is x 0 =[0,0]. 
       FIG. 9  shows an illustrative example on the effectiveness of the proposed controller on an inverted pendulum system in the presence of unknown dynamics. The open-loop controller  920  cannot reach the goal as the system dynamics is incorrect, however the stabilizing controller  910  can stabilize the entire trajectory using time-invariant gains.  FIG. 10A  shows the feedforward (open-loop) control trajectory.  FIG. 10B  shows the gains for the time-invariant feedback matrix π θ =W (note that there are two gains, one for pendulum&#39;s angular position θ and then another one for the angular velocity {dot over (θ)}).  FIG. 10C  shows the time-variant LQR gains obtained by solving the LQR problem at every point of the trajectory using the linearized dynamics, A(k) and B(k).  FIG. 11  shows the statistical behavior of the proposed controller for the same system in presence of several different disturbances injected into the system. As seen, the controller always goes to 0. 
     The proposed robust trajectory-centric controller is tested on a real ball-and-beam system with unknown dynamics. The ball-and-beam system is a low dimensional non-linear system with non-linearity due to the presence of dry friction and delay in the actuators. The ball-and-beam system is modeled with 4 state variables [x, {dot over (x)}, θ, {dot over (θ)}], where x is the position of the ball, is the ball velocity, θ is the angular position of the beam and {dot over (θ)} is the angular velocity of the beam. The acceleration of the ball is given by the following non-linear equation: 
     
       
         
           
             
               x 
               ¨ 
             
             = 
             
               
                 
                   
                     m 
                     
                       b 
                        
                       a 
                        
                       l 
                        
                       l 
                     
                   
                    
                   x 
                    
                   
                     
                       θ 
                       . 
                     
                     2 
                   
                 
                 - 
                 
                   
                     b 
                     1 
                   
                    
                   
                     x 
                     . 
                   
                 
                 - 
                 
                   
                     b 
                     2 
                   
                    
                   
                     m 
                     
                       b 
                        
                       a 
                        
                       l 
                        
                       l 
                     
                   
                    
                   g 
                    
                   
                     
                       cos 
                       . 
                     
                      
                     
                       ( 
                       θ 
                       ) 
                     
                   
                 
                 - 
                 
                   
                     m 
                     
                       b 
                        
                       a 
                        
                       l 
                        
                       l 
                     
                   
                    
                   g 
                    
                   
                       
                   
                    
                   
                     sin 
                      
                     
                       ( 
                       θ 
                       ) 
                     
                   
                 
               
               
                 
                   
                     I 
                     
                       b 
                        
                       a 
                        
                       l 
                        
                       l 
                     
                   
                   
                     r 
                     ball 
                     2 
                   
                 
                 + 
                 
                   m 
                   
                     b 
                      
                     a 
                      
                     l 
                      
                     l 
                   
                 
               
             
           
         
       
     
     where, m ball  is the mass of the ball, I ball  is the rotational inertia of the ball, is the radius of the ball, b 1  is the coefficient of viscous friction of the ball on the beam, b 2  is the coefficient of dry friction of the ball on the beam. An inaccurate model of the system is used to design the open-loop trajectory as well the robust trajectory-cnetri controller. The proposed robust controller achieves better performance than the open-loop controller even with the incorrect model. 
       FIG. 12  shows a ball-and-beam system which consists of a ball  1150  which can move on a beam  1120 . The initial position of the ball is fixed  1110 . The task is to move the ball to desired location and keep it there. The inclination of the beam is measured an encoder  1130  and encoder shaft  1140 .  FIG. 13  shows an example of typical behavior of the proposed trajectory-centric controller compared against the open-loop controller,  FIG. 13  shows that the mean steady error  1210  for the proposed controller goes to zero. However the open-loop controller performs poorly with non-zero steady error  1220 . 
     The above-described embodiments of the present disclosure can be implemented in any of numerous ways. For example, the embodiments may be implemented using hardware, software or a combination thereof. When implemented in software, the software code can be executed on any suitable processor or collection of processors, whether provided in a single computer or distributed among multiple computers. Such processors may be implemented as integrated circuits, with one or more processors in an integrated circuit component. Though, a processor may be implemented using circuitry in any suitable format. 
     Also, the various methods or processes outlined herein may be coded as software that is executable on one or more processors that employ any one of a variety of operating systems or platforms. Additionally, such software may be written using any of a number of suitable programming languages and/or programming or scripting tools, and also may be compiled as executable machine language code or intermediate code that is executed on a framework or virtual machine. Typically, the functionality of the program modules may be combined or distributed as desired in various embodiments. 
     Also, the embodiments of the present disclosure may be embodied as a method, of which an example has been provided. The acts performed as part of the method may be ordered in any suitable way. Accordingly, embodiments may be constructed in which acts are performed in an order different than illustrated, which may include performing some acts concurrently, even though shown as sequential acts in illustrative embodiments. Further, use of ordinal terms such as first, second, in the claims to modify a claim element does not by itself connote any priority, precedence, or order of one claim element over another or the temporal order in which acts of a method are performed, but are used merely as labels to distinguish one claim element having a certain name from another element having a same name (but for use of the ordinal term) to distinguish the claim elements. 
     Although the present disclosure has been described with reference to certain preferred embodiments, it is to be understood that various other adaptations and modifications can be made within the spirit and scope of the present disclosure. Therefore, it is the aspect of the append claims to cover all such variations and modifications as come within the true spirit and scope of the present disclosure.