Math 2.0

Systems theory; control Definition

Stochastic optimal control

Builds on Stochastic differential equationWiener processFiltrationExpected valueLipschitz continuityHamilton–Jacobi–Bellman equation

Definition

Let (Ω,ℱ,(ℱt)t≥0,P)(\Omega, \mathcal{F}, (\mathcal{F}_t)_{t \ge 0}, P) be a probability space with a filtration that carries a dd-dimensional Wiener process WW. Let T>0T > 0 and let U⊆ℝmU \subseteq \R^m be a nonempty closed set, the control set. Let b ⁣:ℝn×U→ℝnb \colon \R^n \times U \to \R^n and σ ⁣:ℝn×U→ℝn×d\sigma \colon \R^n \times U \to \R^{n \times d} be continuous. Assume that they are Lipschitz in xx uniformly in uu, and that ∣b(x,u)∣+∣σ(x,u)∣≤K(1+∣x∣+∣u∣)\abs{b(x, u)} + \abs{\sigma(x, u)} \le K (1 + \abs{x} + \abs{u}) for a constant KK. Let f ⁣:ℝn×U→ℝf \colon \R^n \times U \to \R and g ⁣:ℝn→ℝg \colon \R^n \to \R be continuous with ∣f(x,u)∣≤K(1+∣x∣2+∣u∣2)\abs{f(x, u)} \le K (1 + \abs{x}^2 + \abs{u}^2) and ∣g(x)∣≤K(1+∣x∣2)\abs{g(x)} \le K (1 + \abs{x}^2).

  1. An admissible control is a progressively measurable process u=(ut)0≤t≤Tu = (u_t)_{0 \le t \le T} with values in UU and E∫0T∣ut∣2 dt<∞E \int_0^T \abs{u_t}^2 \, dt < \infty.
  2. For an admissible control uu and x∈ℝnx \in \R^n, the state is the solution XuX^u of the stochastic differential equation dXt=b(Xt,ut) dt+σ(Xt,ut) dWtdX_t = b(X_t, u_t) \, dt + \sigma(X_t, u_t) \, dW_t with X0=xX_0 = x.
  3. The cost of uu is J(x;u)=E[∫0Tf(Xtu,ut) dt+g(XTu)]J(x; u) = E\left[ \int_0^T f(X^u_t, u_t) \, dt + g(X^u_T) \right], an expected value.

The stochastic optimal control problem is to find an admissible control u∗u^* with J(x;u∗)=inf⁡uJ(x;u)J(x; u^*) = \inf_u J(x; u), the infimum over all admissible controls. Such a u∗u^* is an optimal control, and V(x)=inf⁡uJ(x;u)V(x) = \inf_u J(x; u) is the value.

Remarks

Under these hypotheses the state equation has a unique strong solution and the cost is finite. Starting the problem at time tt in state xx gives the value function V(t,x)V(t, x). When VV is smooth enough, it solves the Hamilton–Jacobi–Bellman equation Vt+min⁡u∈U{b(x,u)⋅∇xV+12tr⁡(σσT(x,u)Dx2V)+f(x,u)}=0,V(T,x)=g(x).V_t + \min_{u \in U} \left\{ b(x, u) \cdot \nabla_x V + \tfrac{1}{2} \tr\left( \sigma \sigma^T(x, u) D_x^2 V \right) + f(x, u) \right\} = 0, \qquad V(T, x) = g(x). With σ=0\sigma = 0 the problem is a deterministic optimal control problem.

Example: n=m=d=1n = m = d = 1, U=ℝU = \R, b(x,u)=ub(x, u) = u, σ=1\sigma = 1, f(x,u)=u2/2f(x, u) = u^2 / 2 and g(x)=x2/2g(x) = x^2 / 2. The function V(t,x)=x22(1+T−t)+12ln⁡(1+T−t)V(t, x) = \dfrac{x^2}{2 (1 + T - t)} + \dfrac{1}{2} \ln(1 + T - t) satisfies V(T,x)=x2/2V(T, x) = x^2 / 2. The minimum over uu of uVx+u2/2u V_x + u^2 / 2 is −12Vx2-\frac{1}{2} V_x^2, attained at u=−Vxu = -V_x. With s=1+T−ts = 1 + T - t, one has Vt=x22s2−12sV_t = \frac{x^2}{2 s^2} - \frac{1}{2 s}, 12Vx2=x22s2\frac{1}{2} V_x^2 = \frac{x^2}{2 s^2} and 12Vxx=12s\frac{1}{2} V_{xx} = \frac{1}{2 s}, so the equation holds. The optimal control is the feedback ut=−Xt/(1+T−t)u_t = -X_t / (1 + T - t).

Non-example: the process ut=WTu_t = W_T for all tt is not admissible, because it is not adapted: it uses the future of the noise.

Reading path

To understand this page from the ground up, read these 7 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Expected value concept
  2. Filtration concept
  3. Hamilton–Jacobi–Bellman equation concept
  4. Lipschitz continuity definition
  5. Stochastic differential equation concept
  6. Wiener process concept
  7. Stochastic optimal control definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Stochastic_control
About this page
Tag6KAVKR1HC8
URIm2://6KAVKR1HC8
Kinddefinition
WritingW0 stub
MSC93E20, 49L20
DefinesStochastic optimal control
UsesStochastic differential equation, Wiener process, Filtration, Expected value, Lipschitz continuity, Hamilton–Jacobi–Bellman equation

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.