Pontryagin's maximum principle

Pontryagin's maximum (or minimum) principle is used in optimal control theory to find the best possible control for taking a dynamical system from one state to another, especially in the presence of constraints for the state or input controls. It was formulated in 1956 by the Russian mathematician Lev Pontryagin and his students.[1] It has as a special case the Euler–Lagrange equation of the calculus of variations.

The principle states, informally, that the control Hamiltonian must take an extreme value over controls in the set of all permissible controls. Whether the extreme value is maximum or minimum depends both on the problem and on the sign convention used for defining the Hamiltonian. The normal convention, which is the one used in Hamiltonian, leads to a maximum hence maximum principle but the sign convention used in this article, which apparently comes from,[2] makes the extreme value a minimum, hence the unusual name minimum principle.

If \mathcal{U} is the set of values of permissible controls then the principle states that the optimal control u* must satisfy:

H(x^*(t),u^*(t),\lambda^*(t),t) \leq H(x^*(t),u,\lambda^*(t),t), \quad \forall u \in \mathcal{U}, \quad t \in [t_0, t_f]

where x^*\in C^1[t_0,t_f] is the optimal state trajectory and \lambda^* \in BV[t_0,t_f] is the optimal costate trajectory.[3]

The result was first successfully applied to minimum time problems where the input control is constrained, but it can also be useful in studying state-constrained problems.

Special conditions for the Hamiltonian can also be derived. When the final time t_f is fixed and the Hamiltonian does not depend explicitly on time \left(\tfrac{\partial H}{\partial t} \equiv 0\right), then:

H(x^*(t),u^*(t),\lambda^*(t)) \equiv \mathrm{constant}\,

and if the final time is free, then:

H(x^*(t),u^*(t),\lambda^*(t)) \equiv 0.\,

More general conditions on the optimal control are given below.

When satisfied along a trajectory, Pontryagin's minimum principle is a necessary condition for an optimum. The Hamilton–Jacobi–Bellman equation provides a necessary and sufficient condition for an optimum, but this condition must be satisfied over the whole of the state space.

Maximization and minimization

The principle was first known as Pontryagin's maximum principle and its proof is historically based on maximizing the Hamiltonian. The initial application of this principle was to the maximization of the terminal speed of a rocket. However as it was subsequently mostly used for minimization of a performance index it has here been referred to as the minimum principle. Pontryagin's book solved the problem of minimizing a performance index.[4]

Notation

In what follows we will be making use of the following notation.


\Psi_T(x(T))= \frac{\partial \Psi(x)}{\partial T}|_{x=x(T)} \,

\Psi_x(x(T))=\begin{bmatrix} \frac{\partial
\Psi(x)}{\partial x_1}|_{x=x(T)} & \cdots & \frac{\partial
\Psi(x)}{\partial x_n} |_{x=x(T)}
\end{bmatrix}

H_x(x^*,u^*,\lambda^*,t)=\begin{bmatrix} \frac{\partial H}{\partial x_1}|_{x=x^*,u=u^*,\lambda=\lambda^*}
& \cdots & \frac{\partial H}{\partial x_n}|_{x=x^*,u=u^*,\lambda=\lambda^*}
\end{bmatrix}

L_x(x^*,u^*)=\begin{bmatrix} \frac{\partial L}{\partial x_1}|_{x=x^*,u=u^*}
& \cdots & \frac{\partial L}{\partial x_n}|_{x=x^*,u=u^*}
\end{bmatrix}

f_x(x^*,u^*)=\begin{bmatrix} \frac{\partial f_1}{\partial x_1}|_{x=x^*,u=u^*} & \cdots & \frac{\partial f_1}{\partial x_n}|_{x=x^*,u=u^*} \\
\vdots & \ddots & \vdots \\ \frac{\partial f_n}{\partial x_1}|_{x=x^*,u=u^*} &
\ldots & \frac{\partial f_n}{\partial x_n}|_{x=x^*,u=u^*}
\end{bmatrix}

Formal statement of necessary conditions for minimization problem

Here the necessary conditions are shown for minimization of a functional. Take x to be the state of the dynamical system with input u, such that


\dot{x}=f(x,u), \quad x(0)=x_0, \quad u(t) \in \mathcal{U}, \quad t \in
[0,T]

where \mathcal{U} is the set of admissible controls and T is the terminal (i.e., final) time of the system. The control u \in \mathcal{U} must be chosen for all t \in [0,T] to minimize the objective functional J which is defined by the application and can be abstracted as


J=\Psi(x(T))+\int^T_0 L(x(t),u(t)) \,dt

The constraints on the system dynamics can be adjoined to the Lagrangian L by introducing time-varying Lagrange multiplier vector \lambda, whose elements are called the costates of the system. This motivates the construction of the Hamiltonian H defined for all t \in [0,T] by:


H(\lambda(t),x(t),u(t),t)=\lambda^{\rm T}(t)f(x(t),u(t))+L(x(t),u(t)) \,

where \lambda^{\rm T} is the transpose of \lambda.

Pontryagin's minimum principle states that the optimal state trajectory x^*, optimal control u^*, and corresponding Lagrange multiplier vector \lambda^* must minimize the Hamiltonian H so that


(1) \qquad H(x^*(t),u^*(t),\lambda^*(t),t)\leq H(x^*(t),u,\lambda^*(t),t) \,

for all time t \in [0,T] and for all permissible control inputs u \in \mathcal{U}. It must also be the case that


(2) \qquad \Psi_T(x(T))+H(T)=0 \,

Additionally, the costate equations


(3) \qquad -\dot{\lambda}^{\rm T}(t)=H_x(x^*(t),u^*(t),\lambda(t),t)=\lambda^{\rm T}(t)f_x(x^*(t),u^*(t))+L_x(x^*(t),u^*(t))

must be satisfied. If the final state x(T) is not fixed (i.e., its differential variation is not zero), it must also be that the terminal costates are such that


(4) \qquad \lambda^{\rm T}(T)=\Psi_x(x(T)) \,

These four conditions in (1)-(4) are the necessary conditions for an optimal control. Note that (4) only applies when x(T) is free. If it is fixed, then this condition is not necessary for an optimum.

See also

Notes

  1. See ref. below for first published work.
  2. Ross, I. M. (2009). A Primer on Pontryagin's Principle in Optimal Control. Collegiate Publishers.
  3. More info on C1 and BV spaces
  4. See p.13 of the 1962 book of Pontryagin et al. referenced below.

References

External links


This article is issued from Wikipedia - version of the Tuesday, April 05, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.