Math 2.0

Calculus of variations and optimal control; optimization Optimal control: formulation and existence Problem

Bolza problem

Builds on Optimal controlControl systemAdmissible controlFunctionalMayer and Lagrange problemsFilippov's existence theoremPontryagin's maximum principle

Problem

Let U⊆ℝmU \subseteq \R^m be a nonempty set, and let t0<t1t_0 < t_1 be fixed times. Let f ⁣:[t0,t1]×ℝn×U→ℝnf \colon [t_0, t_1] \times \R^n \times U \to \R^n and L ⁣:[t0,t1]×ℝn×U→ℝL \colon [t_0, t_1] \times \R^n \times U \to \R be continuous. Let φ ⁣:ℝn×ℝn→ℝ\varphi \colon \R^n \times \R^n \to \R be continuous, and let S⊆ℝn×ℝnS \subseteq \R^n \times \R^n be a closed set of allowed endpoint pairs. An admissible control is a measurable map u ⁣:[t0,t1]→Uu \colon [t_0, t_1] \to U whose trajectory xx of the control system x′(t)=f(t,x(t),u(t))x'(t) = f(t, x(t), u(t)) is absolutely continuous on [t0,t1][t_0, t_1] and satisfies (x(t0),x(t1))∈S(x(t_0), x(t_1)) \in S. The Bolza problem asks to minimize the functional J(u)=φ(x(t0),x(t1))+∫t0t1L(t,x(t),u(t)) dtJ(u) = \varphi(x(t_0), x(t_1)) + \int_{t_0}^{t_1} L(t, x(t), u(t)) \, dt over all admissible controls uu.

Remarks

The cost has two parts: an endpoint term φ\varphi and a running term given by the integral of LL. The case L=0L = 0 is the Mayer problem, and the case φ=0\varphi = 0 is the Lagrange problem; see Mayer and Lagrange problems. The three forms are equivalent: adding the state y′=L(t,x,u)y' = L(t, x, u) with y(t0)=0y(t_0) = 0 turns the Bolza cost into the endpoint cost φ(x(t0),x(t1))+y(t1)\varphi(x(t_0), x(t_1)) + y(t_1). In the classical calculus of variations the control is the velocity, f(t,x,u)=uf(t, x, u) = u, and the problem is to minimize φ(x(t0),x(t1))+∫t0t1L(t,x,x′) dt\varphi(x(t_0), x(t_1)) + \int_{t_0}^{t_1} L(t, x, x') \, dt with possible side conditions. Necessary conditions for a minimizer are given by Pontryagin's maximum principle, with transversality conditions coming from φ\varphi and SS. Existence of a minimizer needs extra hypotheses, such as compactness of UU and convexity of the set of velocities and costs; see Filippov's existence theorem.

Reading path

To understand this page from the ground up, read these 12 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. Absolute continuity concept
  2. Admissible control concept
  3. Compact set concept
  4. Control system concept
  5. Convex set concept
  6. Differential inclusion concept
  7. Functional concept
  8. Optimal control concept
  9. Pontryagin's maximum principle statement
  10. Mayer and Lagrange problems problem
  11. Filippov's existence theorem statement
  12. Bolza problem problem

Further reading

  1. Web https://en.wikipedia.org/wiki/Optimal_control
About this page
Tag8Z55NXZWD5
URIm2://8Z55NXZWD5
Kindproblem
WritingW0 stub
MSC49K15, 49J15
StatusThis copy of the site has no build data. Run m2 status 8Z55NXZWD5.
AboutOptimal control
UsesOptimal control, Control system, Admissible control, Functional, Mayer and Lagrange problems, Filippov's existence theorem, Pontryagin's maximum principle

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.