Search

Large-size populations consisting of a continuum of identical and non-cooperative agents with stochastic dynamics are useful in modeling various biological and engineered systems. This paper addresses the stochastic control problem of designing optimal state-feedback controllers which guarantee the closed-loop stability of the stationary density of such agents with nonlinear Langevin dynamics, under the action of their individual steady state controls. We represent the corresponding coupled forward-backward PDEs as decoupled Schr\"odinger equations, by applying two variable transforms. Spectral properties of the linear Schr\"odinger operator which underlie the stability analysis are used to obtain explicit control design constraints. Our interpretation of the Schr\"odinger potential as the cost function of a closely related optimal control problem motivates a quadrature based algorithm to compute the finite-time optimal control., Comment: 21 pages, 2 figures

Stochastic spatio-temporal processes are prevalent across domains ranging from the modeling of plasma, turbulence in fluids to the wave function of quantum systems. This letter studies a measure-theoretic description of such systems by describing them as evolutionary processes on Hilbert spaces, and in doing so, derives a framework for spatio-temporal manipulation from fundamental thermodynamic principles. This approach yields a variational optimization framework for controlling stochastic fields. The resulting scheme is applicable to a wide class of spatio-temporal processes and can be used for optimizing parameterized control policies. Our simulated experiments explore the application of two forms of this approach on four stochastic spatio-temporal processes, with results that suggest new perspectives and directions for studying stochastic control problems for spatio-temporal systems.

Control of continuous time dynamics with multiplicative noise is a classic topic in stochastic optimal control. This work addresses the problem of designing infinite horizon optimal controls with stability guarantees for \textit{a single agent or large population systems} of identical, non-cooperative and non-networked agents, with multi-dimensional and nonlinear stochastic dynamics excited by multiplicative noise. For agent dynamics belonging to the class of reversible diffusion processes, we provide constraints on the state and control cost functions which guarantee stability of the closed-loop system under the action of the individual optimal controls. A condition relating the state-dependent control cost and volatility is introduced to prove the stability of the equilibrium density. This condition is a special case of the constraint required to use the path integral Feynman-Kac formula for computing the control. We investigate the connection between the stabilizing optimal control and the path integral formalism, leading us to a control law formulation expressed exclusively in terms of the desired equilibrium density., 6 pages, 0 figures, IEEE Conference on Decision and Control 2020 (accepted)

Determining how the nervous system controls tendon-driven bodies remains an open question. Stochastic optimal control (SOC) has been proposed as a plausible analogy in the neuroscience community. SOC relies on solving the Hamilton-Jacobi-Bellman equation, which seeks to minimize a desired cost function for a given task with noisy controls. We evaluate and compare three SOC methodologies to produce tapping by a simulated planar 3-joint human index finger: iterative Linear Quadratic Gaussian (iLQG), Model-Predictive Path Integral Control (MPPI), and Deep Forward-Backward Stochastic Differential Equations (FBSDE). We show that averaged over 128 repeats these methodologies can place the fingertip at the desired final joint angles but–because of kinematic redundancy and the presence of noise–they each have joint trajectories and final postures with different means and variances. iLQG in particular, had the largest kinematic variance and departure from the final desired joint angles. We demonstrate that MPPI and FBSDE have superior performance for such nonlinear, tendon-driven systems with noisy controls.Clinical relevance— The mathematical framework provided by MPPI and FBSDE may be best suited for tendon-driven anthropomorphic robots, exoskeletons, and prostheses for amputees.

A distributed stochastic optimal control solution is presented for cooperative multi-agent systems. The network of agents is partitioned into multiple factorial subsystems, each of which consists of a central agent and neighboring agents. Local control actions that rely only on agents' local observations are designed to optimize the joint cost functions of subsystems. When solving for the local control actions, the joint optimality equation for each subsystem is cast as a linear partial differential equation and solved using the Feynman-Kac formula. The solution and the optimal control action are then formulated as path integrals and approximated by a Monte-Carlo method. Numerical verification is provided through a simulation example consisting of a team of cooperative UAVs., To appear in American Control Conference 2021, New Orleans, LA, USA

The aim of this work is to present a sampling-based algorithm designed to solve a certain class of stochastic optimal control problems, utilizing forward and backward stochastic differential equations (FBSDEs). Specifically, we address the class of problems in which the running cost of the performance index involves an L 1 -type minimization problem in terms of the control effort. Such problems are typically called minimum fuel problems in optimal control literature. By means of a nonlinear version of the Feynman–Kac lemma, we obtain a probabilistic representation of the solution to the nonlinear Hamilton–Jacobi–Bellman equation, expressed in the form of a system of decoupled FBSDEs. This system of FBSDEs can be solved by employing linear regression techniques.

The aim of this work is to present a novel sampling-based numerical scheme designed to solve a certain class of stochastic optimal control problems, utilizing forward and backward stochastic differential equations (FBSDEs). By means of a nonlinear version of the Feynman–Kac lemma, we obtain a probabilistic representation of the solution to the nonlinear Hamilton–Jacobi–Bellman equation, expressed in the form of a system of decoupled FBSDEs. This system of FBSDEs can be solved by employing linear regression techniques. The proposed framework relaxes some of the restrictive conditions present in recent sampling based methods within the Linearly Solvable Optimal Control framework, and furthermore addresses problems in which the time horizon is not prespecified. To enhance the efficiency of the proposed scheme when treating more complex nonlinear systems, we then derive an iterative algorithm based on Girsanov’s theorem on the change of measure, which features importance sampling. This scheme is shown to be capable of learning the optimal control without requiring an initial guess.

In this paper, a model predictive path integral control algorithm based on a generalized importance sampling scheme is developed and parallel optimization via sampling is performed using a graphics...

This paper presents a novel approach to numerically solve stochastic differential games for nonlinear systems. The proposed approach relies on the nonlinear Feynman-Kac theorem that establishes a connection between parabolic deterministic partial differential equations and forward-backward stochastic differential equations. Using this theorem the Hamilton-Jacobi-Isaacs partial differential equation associated with differential games is represented by a system of forward-backward stochastic differential equations. Numerical solution of the aforementioned system of stochastic differential equations is performed using importance sampling and a Long-Short Term Memory recurrent neural network, which is trained in an offline fashion. The resulting algorithm is tested on two example systems in simulation and compared against the standard risk neutral stochastic optimal control formulations.

In this paper we propose a new methodology for decision-making under uncertainty using recent advancements in the areas of nonlinear stochastic optimal control theory, applied mathematics, and machine learning. Grounded on the fundamental relation between certain nonlinear partial differential equations and forward-backward stochastic differential equations, we develop a control framework that is scalable and applicable to general classes of stochastic systems and decision-making problem formulations in robotics and autonomy. The proposed deep neural network architectures for stochastic control consist of recurrent and fully connected layers. The performance and scalability of the aforementioned algorithm are investigated in three non-linear systems in simulation with and without control constraints. We conclude with a discussion on future directions and their implications to robotics.

Path Integral control theory yields a sampling-based methodology for solving stochastic optimal control problems. Motivated by its computational efficiency, we extend this framework to account for systems evolving on Lie groups. Our derivation relies on recursive mappings between system poses and corresponding Lie algebra elements. This allows us to apply standard facts from stochastic calculus, and obtain expressions analogous to those of Euclidean problems. The results imply that stochastic optimal control can be applied in a parameterization-free manner, even when nonlinear configuration spaces are considered. The method is tested in simulation on a simple model of a rigid satellite.

In this paper we investigate whether the linearly solvable stochastic optimal control framework generalizes to the case of stochastic differential equations in infinite dimensional spaces. In particular, we show that the connection between the relative entropy-free energy relation and dynamic programming principles caries over to infinite dimensional spaces. Our analysis is based on a generalization of the Feynman-Kac lemma for certain classes of infinite dimensional diffusions and Hilbert space-valued Q-Wiener processes. We observe that the utilized information theoretic representation allows the formulation of variational problems for parameterized policy optimization of infinite dimensional systems. This work creates new research avenues towards the development of parallelizable stochastic control and inference algorithms for infinite dimensional dynamical systems in physics, fluid mechanics, partially observable stochastic control and open quantum systems.

In this paper we present an information theoretic approach to stochastic optimal control problems for systems with compound Poisson noise. We generalize previous work on information theoretic path integral control to discontinuous dynamics with compound Poisson noise. We also derive a control update law of the same form using a stochastic optimization approach. We develop a sampling-based iterative model predictive control (MPC) algorithm. The proposed algorithm is parallelizable and when implemented on a Graphical Processing Unit (GPU) can run in real time. We test the performance of the proposed algorithm in simulation for two control tasks using a cartpole and a quadrotor system. Our simulations demonstrate improved performance of the new scheme and indicate the importance of incorporating the statistical characteristics of stochastic disturbances in the computation of the stochastic optimal control policies.

In this paper, we present connections between recent developments on the linearly-solvable stochastic optimal control framework with early work in control theory based on the fundamental dualities between free energy and relative entropy. We extend these connections to nonlinear stochastic systems with non-affine controls by using the generalized version of the Feynman–Kac lemma. We present alternative formulations of the linearly-solvable stochastic optimal control framework and discuss information theoretic and thermodynamic interpretations. On the algorithmic side, we present iterative stochastic optimal control algorithms and applications to nonlinear stochastic systems. We conclude with an overview of the frameworks presented and discuss limitations, differences and future directions.

The Hamilton Jacobi Bellman (HJB) PDE for the stochastic optimal control (SOC) problem for diffusion SDE dynamics which have affine controls and state and control multiplicative noise is a second order fully nonlinear PDE. The previously known linearly solvable optimal control framework as well as the first order forward backward SDEs (FBSDEs) frameworks therefore have a characteristic inadequacy to support sampling algorithms for this SOC problem. We present the framework of second order FBSDEs for solving this SOC problem in this paper. We derive the nonlinear Feynman Kac representation of the second order fully nonlinear HJB PDE corresponding to diffusions with state and control multiplicative noise. The Feynman Kac representation enables a sampling based scheme for solving this SOC problem. This scheme is then leveraged to develop a least squares Monte Carlo regression based algorithm for implementations. The algorithm is validated by examples of simulated control of an underactuated system and comparison against an analytical characterization.

We present a sampling-based stochastic optimal control (SOC) framework for systems with unknown dynamics based on the path integral formulation and probabilistic inference. This work is motivated by three major limitations of related SOC methods: first, full knowledge of the dynamics model is usually required. Second, model uncertainty is neglected. Third, convergence of the iterative scheme is quite slow. In order to cope with these issues, our method performs sampling in belief space using approximate inference in probabilistic models. When performing probability-weighted averaging, each sample is weighted by its predictive uncertainty. In addition, our method leverages covariance matrix adaptation to achieve faster convergence. We demonstrate the effectiveness and efficiency of the proposed method using a simulated cart-pole swing up task.

In this work we present a sampling-based algorithm designed to solve game-theoretic control problems and risk-sensitive stochastic optimal control problems. The cornerstone of the proposed approach is the formulation of the problem in terms of forward and backward stochastic differential equations (FBSDEs). By means of a nonlinear version of the Feynman-Kac lemma, we obtain a probabilistic representation of the solution to the nonlinear Hamilton-Jacobi-Isaacs equation, expressed in the form of a decoupled system of FBSDEs. This system of FBSDEs can then be simulated by employing linear regression techniques. Utilizing the connection between stochastic differential games and risk-sensitive optimal control, we demonstrate that the proposed algorithm is also applicable to the latter class of problems. Simulation results validate the algorithm.

We present the infinite dimensional approach to control of a general class of doubly stochastic or otherwise known Q-mark Markov Jump Diffusion (Q-MJD) processes. The governing dynamics for the the probability density function (PDF) of this class of Q-MJD processes is a Partial Integro Differential Equation (PIDE). The infinite dimensional Minimum Principle (MP) is applied to control these PIDE dynamics. We qualitatively compare the infinite dimensional MP and the stochastic Dynamic Programming Principle (DPP) frameworks as applied to control of Q-MJD processes. The developed sampling based algorithms illustrate how the presented framework is a multi trajectory optimization method to solve nonlinear stochastic optimal control problems for Q-MJD processes.

In this paper a novel method towards solving the Stochastic Optimal Control problem is proposed, which is based on the combination of the generalized Polynomial Chaos theory and the Differential Dynamic Programming framework. Utilizing the Polynomial Chaos theory allows us to handle a wide range of uncertainties, without having to rely on limiting assumptions regarding the form of stochasticity. In addition, the Differential Dynamic Programming framework provides an iterative algorithm for finding optimal controls, which attains scalability and, under mild assumptions, fast convergence. Last but not least, towards increasing the numerical stability of our algorithm, the concept of Variational Integrators is incorporated. Numerical examples validate the applicability of the proposed approach.

In this paper we present a model predictive control algorithm designed for optimizing non-linear systems subject to complex cost criteria. The algorithm is based on a stochastic optimal control framework using a fundamental relationship between the information theoretic notions of free energy and relative entropy. The optimal controls in this setting take the form of a path integral, which we approximate using an efficient importance sampling scheme. We experimentally verify the algorithm by implementing it on a Graphics Processing Unit (GPU) and apply it to the problem of controlling a fifth-scale Auto-Rally vehicle in an aggressive driving task.

One of the hallmarks of the performance, versatility, and robustness of biological motor control is the ability to adapt the impedance of the overall biomechanical system to different task requirements and stochastic disturbances. A transfer of this principle to robotics is desirable, for instance to enable robots to work robustly and safely in everyday human environments. It is, however, not trivial to derive variable impedance controllers for practical high degree-of-freedom (DOF) robotic tasks. In this contribution, we accomplish such variable impedance control with the reinforcement learning (RL) algorithm PI2 (P olicyI mprovement withP ath I ntegrals). PI2 is a model-free, sampling-based learning method derived from first principles of stochastic optimal control. The PI2 algorithm requires no tuning of algorithmic parameters besides the exploration noise. The designer can thus fully focus on the cost function design to specify the task. From the viewpoint of robotics, a particular useful property of PI2 is that it can scale to problems of many DOFs, so that reinforcement learning on real robotic systems becomes feasible. We sketch the PI2 algorithm and its theoretical properties, and how it is applied to gain scheduling for variable impedance control. We evaluate our approach by presenting results on several simulated and real robots. We consider tasks involving accurate tracking through via points, and manipulation tasks requiring physical contact with the environment. In these tasks, the optimal strategy requires both tuning of a reference trajectory and the impedance of the end-effector. The results show that we can use path integral based reinforcement learning not only for planning but also to derive variable gain feedback controllers in realistic scenarios. Thus, the power of variable impedance control is made available to a wide variety of robotic systems and practical applications.

In this paper we present a novel sampling-based numerical scheme designed to solve a certain class of stochastic optimal control problems, utilizing forward and backward stochastic differential equations (FBSDEs). By means of a nonlinear version of the Feynman-Kac lemma, we obtain a probabilistic representation of the solution to the nonlinear Hamilton-Jacobi-Bellman equation, expressed in the form of a decoupled system of FBSDEs. This system of FBSDEs can then be simulated by employing linear regression techniques. To enhance the efficiency of the proposed scheme when treating more complex nonlinear systems, we then derive an iterative modification based on Girsanov's theorem on the change of measure, which features importance sampling. The modified scheme is capable of learning the optimal control without requiring an initial guess. We present simulations that validate the algorithm and demonstrate its efficiency in treating nonlinear dynamics.

This paper considers optimal control of dynamical systems which are represented by nonlinear stochastic differential equations. It is well-known that the optimal control policy for this problem can be obtained as a function of a value function that satisfies a nonlinear partial differential equation, namely, the Hamilton-Jacobi-Bellman equation. This nonlinear PDE must be solved backwards in time, and this computation is intractable for large scale systems. Under certain assumptions, and after applying a logarithmic transformation, an alternative characterization of the optimal policy can be given in terms of a path integral. Path Integral (PI) based control methods have recently been shown to provide elegant solutions to a broad class of stochastic optimal control problems. One of the implementation challenges with this formalism is the computation of the expectation of a cost functional over the trajectories of the unforced dynamics. Computing such expectation over trajectories that are sampled uniformly may induce numerical instabilities due to the exponentiation of the cost. Therefore, sampling of low-cost trajectories is essential for the practical implementation of PI-based methods. In this paper, we use incremental sampling-based algorithms to sample useful trajectories from the unforced system dynamics, and make a novel connection between Rapidly-exploring Random Trees (RRTs) and information-theoretic stochastic optimal control. We show the results from the numerical implementation of the proposed approach to several examples., 18 pages

We present two nonparametric approaches to Kullback-Leibler (KL) control, or linearly-solvable Markov decision problem (LMDP) based on Gaussian processes (GP) and Nystr\"{o}m approximation. Compared to recently developed parametric methods, the proposed data-driven frameworks feature accurate function approximation and efficient on-line operations. Theoretically, we derive the mathematical connection of KL control based on dynamic programming with earlier work in control theory which relies on information theoretic dualities for the infinite time horizon case. Algorithmically, we give explicit optimal control policies in nonparametric forms, and propose on-line update schemes with budgeted computational costs. Numerical results demonstrate the effectiveness and usefulness of the proposed frameworks.

We develop a general class of stochastic optimal control problems for which the problem of designing optimal linear feedback gains is convex. The class of problems includes arbitrary time varying linear systems and costs that are mixtures of exponentiated quadratics. This allows us to model problems with quadratic state costs and linear constraints on states and state transitions. Further, convexity in the feedback gains lets us impose arbitrary convex constraints or penalties on the feedback matrix: Thus we can model problems like distributed control (by imposing a sparsity structure on the feedback matrix) and variable-stiffness control (by applying time-varying penalties to feedback gain matrices). We show that the convex optimization problem can be solved efficiently by using the structure of the matrices involved. Finally, we present an application of these ideas to a practical problem arising in distributed control of power systems.

We derive Policy Gradients(PGs) with time varying parameterizations for nonlinear diffusion processes affine in noise. The resulting policies have the form of reward weighted gradient. The analysis is in continuous time and includes the case of linear and nonlinear parameterizations. Examples on stochastic control problems for diffusions processes are provided.

We provide optimal control laws by using tools from stochastic calculus of variations and the mathematical concept of δ-sensitivity. The analysis relies on logarithmic transformations of the value functions and the use of linearly solvable Partial Differential Equations(PDEs). We derive the corresponding optimal control as a function of the δ-sensitivity of the logarithmic transformation of the value function for the case of nonlinear diffusion processes affine in control and noise.

This paper integrates recent work on Path Integral (PI) and Kullback Leibler (KL) divergence stochastic optimal control theory with earlier work on risk sensitivity and the fundamental dualities between free energy and relative entropy. We derive the path integral optimal control framework and its iterative version based on the aforemetioned dualities. The resulting formulation of iterative path integral control is valid for general feedback policies and in contrast to previous work, it does not rely on pre-specified policy parameterizations. The derivation is based on successive applications of Girsanov's theorem and the use of Radon-Nikodým derivative as applied to diffusion processes due to the change of measure in the stochastic dynamics. We compare the PI control derived based on Dynamic Programming with PI based on the duality between free energy and relative entropy. Moreover we extend our analysis on the applicability of the relationship between free energy and relative entropy to optimal control of markov jump diffusions processes. Furthermore, we present the links between KL stochastic optimal control and the aforementioned dualities and discuss its generalizability.

Our long-term goal is to find control principles to control robotic hands with dexterity and robustness comparable to that of the human hand. Here we explore a control strategy capable of accommodating the nonlinearities, high dimensionality and endogenous noise intrinsic to complex, tendon-driven biomechanical structures. We present the first stochastic optimal feedback controller (i.e., an iterative Linear Quadratic Gaussian controller) applied to a tendon-driven simulated robotic index finger model. In our model we take into account both the tendon network driving of the index finger, and we consider first-order muscle dynamics. Our feedback controller shows robustness against noise and perturbation of the dynamics. Moreover, it can also successfully overcome the nonlinearities intrinsic to the mechanics of the finger for large postural changes, and the need for non-negative control signals. Our simulations provide, for the first time, the complete time history of tendon tensions, lengths and velocities for the tasks of tapping with nonzero terminal velocities required for dynamic manipulation. We find that the optimal control of realistic tendon-driven systems fundamentally stretches current methods to their limits. To find a successful control strategy, the algorithm must overcome several critical challenges inherent to the control of tendon-driven fingers systems in which all uni-directional control commands can actuate all joints (either directly or through dynamic coupling). Therefore, all elements of the solution are interwoven including the tuning of the cost function, the dynamics of the plant, and the initial guesses for state and control trajectories.

Applying reinforcement learning to humanoid robots is challenging because humanoids have a large number of degrees of freedom and state and action spaces are continuous. Thus, most reinforcement learning algorithms would become computationally infeasible and require a prohibitive amount of trials to explore such high-dimensional spaces. In this paper, we present a probabilistic reinforcement learning approach, which is derived from the framework of stochastic optimal control and path integrals. The algorithm, called Policy Improvement with Path Integrals (PI2), has a surprisingly simple form, has no open tuning parameters besides the exploration noise, is model-free, and performs numerically robustly in high dimensional learning problems. We demonstrate how PI2 is able to learn full-body motor skills on a 34-DOF humanoid robot. To demonstrate the generality of our approach, we also apply PI2 in the context of variable impedance control, where both planned trajectories and gain schedules for each joint are optimized simultaneously.

We provide an overview of optimal control methods to nonlinear neuromuscular systems and discuss their limitations. Moreover we extend current optimal control methods to their application to neuromuscular models with realistically numerous musculotendons; as most prior work is limited to torque-driven systems. Recent work on computational motor control has explored the used of control theory and estimation as a conceptual tool to understand the underlying computational principles of neuromuscular systems. After all, successful biological systems regularly meet conditions for stability, robustness and performance for multiple classes of complex tasks. Among a variety of proposed control theory frameworks to explain this, stochastic optimal control has become a dominant framework to the point of being a standard computational technique to reproduce kinematic trajectories of reaching movements (see [12]) In particular, we demonstrate the application of optimal control to a neuromuscular model of the index finger with all seven musculotendons producing a tapping task. Our simulations include 1) a muscle model that includes force- length and force-velocity characteristics; 2) an anatomically plausible biomechanical model of the index finger that includes a tendinous network for the extensor mechanism and 3) a contact model that is based on a nonlinear spring-damper attached at the end effector of the index finger. We demonstrate that it is feasible to apply optimal control to systems with realistically large state vectors and conclude that, while optimal control is an adequate formalism to create computational models of neuro-musculoskeletal systems, there remain important challenges and limitations that need to be considered and overcome such as contact transitions, curse of dimensionality, and constraints on states and controls.

Although there has been a significant amount of work in the area of stochastic optimal control theory towards the development of new algorithms, the problem of how to control a stochastic nonlinear system remains an open research topic. Recent iterative linear quadratic optimal control methods iLQG [1], [2] handle control and state multiplicative noise while they are derived based on first order approximation of dynamics. On the other hand, methods such as Differential Dynamic Programming expand the dynamics up to the second order but so far they can handle nonlinear systems with additive noise. In this work we present a generalization of the classic Differential Dynamic Programming algorithm. We assume the existence of state and control multiplicative process noise, and proceed to derive the second-order expansion of the cost-to-go. We find the correction terms that arise from the stochastic assumption. Despite having quartic and cubic terms in the initial expression, we show that these vanish, leaving us with the same quadratic structure as standard DDP.

Reinforcement learning (RL) is one of the most general approaches to learning control. Its applicability to complex motor systems, however, has been largely impossible so far due to the computational difficulties that reinforcement learning encounters in high dimensional continuous state-action spaces. In this paper, we derive a novel approach to RL for parameterized control policies based on the framework of stochastic optimal control with path integrals. While solidly grounded in optimal control theory and estimation theory, the update equations for learning are surprisingly simple and have no danger of numerical instabilities as neither matrix inversions nor gradient learning rates are required. Empirical evaluations demonstrate significant performance improvements over gradient-based policy learning and scalability to high-dimensional control problems. Finally, a learning experiment on a robot dog illustrates the functionality of our algorithm in a real-world scenario. We believe that our new algorithm, Policy Improvement with Path Integrals (PI2), offers currently one of the most efficient, numerically robust, and easy to implement algorithms for RL in robotics.

Recent advances on path integral stochastic optimal control [1],[2] provide new insights in the optimal control of nonlinear stochastic systems which are linear in the controls, with state independent and time invariant control transition matrix. Under these assumptions, the Hamilton-Jacobi-Bellman (HJB) equation is formulated and linearized with the use of the logarithmic transformation of the optimal value function. The resulting HJB is a linear second order partial differential equation which is solved by an approximation based on the Feynman-Kac formula [3]. In this work we review the theory of path integral control and derive the linearized HJB equation for systems with state dependent control transition matrix. In addition we derive the path integral formulation for the general class of systems with state dimensionality that is higher than the dimensionality of the controls. Furthermore, by means of a modified inverse dynamics controller, we apply path integral stochastic optimal control over the new control space. Simulations illustrate the theoretical results. Future developments and extensions are discussed.