Math 2.0

Calculus of variations and optimal control; optimization Definition

Value function

Builds on Optimal controlAdmissible controlControl systemCompact set

Definition

Let U⊆ℝmU \subseteq \R^m be a nonempty compact set and T>0T > 0. Let f ⁣:[0,T]×ℝn×U→ℝnf \colon [0, T] \times \R^n \times U \to \R^n be continuous and Lipschitz in xx uniformly in (t,u)(t, u). Let L ⁣:[0,T]×ℝn×U→ℝL \colon [0, T] \times \R^n \times U \to \R and g ⁣:ℝn→ℝg \colon \R^n \to \R be continuous. For (t,x)∈[0,T]×ℝn(t, x) \in [0, T] \times \R^n and a measurable control u ⁣:[t,T]→Uu \colon [t, T] \to U, let yy be the trajectory of the control system y′=f(s,y,u)y' = f(s, y, u) with y(t)=xy(t) = x, and set J(t,x;u)=∫tTL(s,y(s),u(s)) ds+g(y(T)).J(t, x; u) = \int_t^T L(s, y(s), u(s)) \, ds + g(y(T)). The value function of this optimal control problem is the function V ⁣:[0,T]×ℝn→ℝV \colon [0, T] \times \R^n \to \R given by V(t,x)=inf⁡{J(t,x;u):u ⁣:[t,T]→U measurable}.V(t, x) = \inf \set{ J(t, x; u) : u \colon [t, T] \to U \text{ measurable} }.

Remarks

Under these hypotheses the trajectories from (t,x)(t, x) stay in a bounded set, so VV is finite. By definition V(T,x)=g(x)V(T, x) = g(x), and a control uu is optimal from (t,x)(t, x) exactly when J(t,x;u)=V(t,x)J(t, x; u) = V(t, x). Example: n=m=1n = m = 1, U=[−1,1]U = [-1, 1], f(t,x,u)=uf(t, x, u) = u, L=0L = 0 and g(x)=∣x∣g(x) = \abs{x}. From (t,x)(t, x) one can move toward 00 at speed at most 11, so V(t,x)=max⁡(∣x∣−(T−t),0)V(t, x) = \max(\abs{x} - (T - t), 0). This VV is Lipschitz but not differentiable where ∣x∣=T−t\abs{x} = T - t and t<Tt < T. Non-example: the cost J(t,x;u0)J(t, x; u_0) of one fixed control u0u_0 is in general not the value function. For u0=0u_0 = 0 in the example it is ∣x∣\abs{x}, which is larger than V(t,x)V(t, x) when x≠0x \ne 0 and t<Tt < T. For maximization problems the infimum is replaced by a supremum. For infinite-horizon problems with discounting, VV depends only on the initial state.

Reading path

To understand this page from the ground up, read these 5 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. Admissible control concept
  2. Compact set concept
  3. Control system concept
  4. Optimal control concept
  5. Value function definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Value_function
About this page
TagBV6HGA075P
URIm2://BV6HGA075P
Kinddefinition
WritingW0 stub
MSC49L20, 49L12, 93E20
DefinesValue function
UsesOptimal control, Admissible control, Control system, Compact set

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.