Math 2.0

Calculus of variations and optimal control; optimization Definition

Indirect method by shooting

Builds on Shooting methodPontryagin's maximum principleHamiltonian of an optimal control problemCostate equationNewton's method

Definition

Let T>0T > 0, x0,x1∈ℝnx_0, x_1 \in \R^n, let U⊆ℝmU \subseteq \R^m be nonempty, and let f ⁣:ℝn×U→ℝnf \colon \R^n \times U \to \R^n and L ⁣:ℝn×U→ℝL \colon \R^n \times U \to \R be continuously differentiable in xx. Consider the problem of minimising ∫0TL(x,u) dt\int_0^T L(x, u) \, dt subject to x′=f(x,u)x' = f(x, u), x(0)=x0x(0) = x_0, x(T)=x1x(T) = x_1. Let H(x,u,p)=p⋅f(x,u)−L(x,u)H(x, u, p) = p \cdot f(x, u) - L(x, u) be the Hamiltonian in the normal case of Pontryagin's maximum principle. Assume that for all (x,p)(x, p) the function u↦H(x,u,p)u \mapsto H(x, u, p) has a unique maximiser u∗(x,p)u^*(x, p) in UU, and that u∗u^* is continuously differentiable. For p0∈ℝnp_0 \in \R^n, let (x(⋅ ;p0),p(⋅ ;p0))(x(\cdot\,; p_0), p(\cdot\,; p_0)) be the solution on [0,T][0, T], if it exists, of x′=f(x,u∗(x,p)),p′=−∂H∂x(x,u∗(x,p),p),x(0)=x0,p(0)=p0.x' = f(x, u^*(x, p)), \qquad p' = -\frac{\partial H}{\partial x}(x, u^*(x, p), p), \qquad x(0) = x_0, \qquad p(0) = p_0. The shooting function is S(p0)=x(T;p0)−x1S(p_0) = x(T; p_0) - x_1. The indirect method by shooting computes a zero p0∗p_0^* of SS, for example by Newton's method, and returns the control u(t)=u∗(x(t;p0∗),p(t;p0∗))u(t) = u^*(x(t; p_0^*), p(t; p_0^*)).

Remarks

The second equation is the costate equation. Every normal extremal of the maximum principle with these endpoints comes from a zero of SS, so the method computes candidates for optimality, not proven minimisers. The method is a special case of the shooting method, with unknowns p0p_0 instead of an initial slope. Free final time or other boundary conditions add unknowns and equations to SS, from the transversality conditions. Multiple shooting splits [0,T][0, T] into pieces to reduce the sensitivity of SS.

Example: n=m=1n = m = 1, T=1T = 1, f=uf = u, L=u2/2L = u^2 / 2, U=ℝU = \R, x0=0x_0 = 0 and x1=1x_1 = 1. Here H=pu−u2/2H = p u - u^2 / 2, so u∗=pu^* = p, and p′=0p' = 0. Hence p(t)=p0p(t) = p_0, x(t)=p0tx(t) = p_0 t and S(p0)=p0−1S(p_0) = p_0 - 1. The zero is p0∗=1p_0^* = 1, which gives the optimal control u=1u = 1.

Non-example: if U=[−1,1]U = [-1, 1] and L=0L = 0 with f=uf = u, the maximiser of H=puH = p u is not unique when p=0p = 0 and is not differentiable in pp. Then the map u∗u^* of the definition does not exist, and the method must be adapted to the bang-bang structure.

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. Control system concept
  3. Costate equation concept
  4. Hamiltonian of an optimal control problem concept
  5. Limit point of a set definition
  6. Shooting method concept
  7. Pontryagin's maximum principle statement
  8. Limit of a function definition
  9. Derivative definition
  10. Tangent line concept
  11. Newton's method concept
  12. Indirect method by shooting definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Shooting_method
About this page
TagP0XFYRE9P2
URIm2://P0XFYRE9P2
Kinddefinition
WritingW0 stub
MSC49M05, 65L10, 49K15
DefinesIndirect method by shooting
UsesShooting method, Pontryagin's maximum principle, Hamiltonian of an optimal control problem, Costate equation, Newton's method

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.