Math 2.0

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

Mayer and Lagrange problems

Builds on Optimal controlControl systemAdmissible controlFunctional

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 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.

  1. The Mayer problem: given a continuous function φ ⁣:ℝn×ℝn→ℝ\varphi \colon \R^n \times \R^n \to \R, minimize J(u)=φ(x(t0),x(t1))J(u) = \varphi(x(t_0), x(t_1)) over all admissible controls uu.
  2. The Lagrange problem: given a continuous function L ⁣:[t0,t1]×ℝn×U→ℝL \colon [t_0, t_1] \times \R^n \times U \to \R, minimize the functional J(u)=∫t0t1L(t,x(t),u(t)) dtJ(u) = \int_{t_0}^{t_1} L(t, x(t), u(t)) \, dt over all admissible controls uu.

Remarks

The Mayer problem has only an endpoint cost, and the Lagrange problem has only a running cost. Both are special cases of the Bolza problem, whose cost is the sum of the two. They are equivalent to each other. A Lagrange problem becomes a Mayer problem with the extra state y′=L(t,x,u)y' = L(t, x, u), y(t0)=0y(t_0) = 0, and the endpoint cost y(t1)y(t_1). A Mayer problem with φ\varphi of class C1C^1 that depends only on x(t1)x(t_1), and a fixed initial state x(t0)=ax(t_0) = a, becomes a Lagrange problem with L(t,x,u)=∇φ(x)⋅f(t,x,u)L(t, x, u) = \nabla \varphi(x) \cdot f(t, x, u), since φ(x(t1))=φ(a)+∫t0t1∇φ(x(t))⋅x′(t) dt\varphi(x(t_1)) = \varphi(a) + \int_{t_0}^{t_1} \nabla\varphi(x(t)) \cdot x'(t) \, dt. The Mayer form is convenient for existence proofs and for geometric arguments with reachable sets. The Lagrange form is the classical form of the calculus of variations.

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. Control system concept
  3. Functional concept
  4. Optimal control concept
  5. Mayer and Lagrange problems problem

Where this leads

3 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Optimal_control
About this page
Tag1J8TYT7C49
URIm2://1J8TYT7C49
Kindproblem
WritingW0 stub
MSC49K15, 49J15
StatusThis copy of the site has no build data. Run m2 status 1J8TYT7C49.
AboutOptimal control
UsesOptimal control, Control system, Admissible control, Functional

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

Used by