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 Semenovich Pontryagin and his students.^{[1] [2]} It has as a special case the Euler–Lagrange equation of the calculus of variations.

The principle states informally that the Hamiltonian must be minimized over ${\displaystyle {\mathcal {U}}}$, the set of all permissible controls. If ${\displaystyle u^{*}\in {\mathcal {U}}}$ is the optimal control for the problem, then the principle states that:

${\displaystyle 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 ${\displaystyle x^{*}\in C^{1}[t_{0},t_{f}]}$ is the optimal state trajectory and ${\displaystyle \lambda ^{*}\in BV[t_{0},t_{f}]}$ is the optimal costate trajectory.

The result was first successfully applied into 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 ${\displaystyle t_{f}}$ is fixed and the Hamiltonian does not depend explicitly on time ${\displaystyle \left({\tfrac {\partial H}{\partial t}}\equiv 0\right)}$, then:

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

and if the final time is free, then:

${\displaystyle 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.^[3]

Notation

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

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

${\displaystyle \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}}}$

${\displaystyle 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}}}$

${\displaystyle 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}}}$

${\displaystyle 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 ${\displaystyle x}$ to be the state of the dynamical system with input ${\displaystyle u}$, such that

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

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

${\displaystyle J=\Psi (x(T))+\int _{0}^{T}L(x(t),u(t))\,dt}$

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

${\displaystyle H(\lambda (t),x(t),u(t),t)=\lambda '(t)f(x(t),u(t))+L(x(t),u(t))\,}$

where ${\displaystyle \lambda '}$ is the transpose of ${\displaystyle \lambda }$.

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

${\displaystyle (1)\qquad H(x^{*}(t),u^{*}(t),\lambda ^{*}(t),t)\leq H(x^{*}(t),u,\lambda ^{*}(t),t)\,}$

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

${\displaystyle (2)\qquad \Psi _{T}(x(T))+H(T)=0\,}$

Additionally, the costate equations

${\displaystyle (3)\qquad -{\dot {\lambda }}'(t)=H_{x}(x^{*}(t),u^{*}(t),\lambda (t),t)=\lambda '(t)f_{x}(x^{*}(t),u^{*}(t))+L_{x}(x^{*}(t),u^{*}(t))}$

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

${\displaystyle (4)\qquad \lambda '(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 ${\displaystyle x(T)}$ is free. If it is fixed, then this condition is not necessary for an optimum.

See also

• Lagrange multipliers on Banach spaces, Lagrangian method in calculus of variations

Notes

References

• V.G. Boltyanskii, R.V. Gamkrelidze. L.S. Pontryagin: Towards a theory of optimal processes, (Russian), Reports Acad. Sci. USSR, vol.110(1), 1956
• Pontryagin L.S, Boltyanskii V.G, Gamkrelidze R. V, Mishchenko E. F, The Mathematical Theory of Optimal Processes (Russian), English translation: Interscience 1962. ISBN 2-88124-077-1 and ISBN 978-2-88124-077-5
• Fuller A.T. Bibliography of Pontryagin's maximum principle, J. Electronics & Control vol.15 no.5 Nov. 1963 pp. 513–517
• Kirk, D.E. Optimal Control Theory, An Introduction, Prentice Hall, 1970. ISBN 0-486-43484-2
• Sethi, S. P. and Thompson, G. L. Optimal Control Theory: Applications to Management Science and Economics, 2nd edition, Springer, 2000. ISBN 0-387-28092-8 and ISBN 0-7923-8608-6. Slides are available at http://www.utdallas.edu/~sethi/OPRE7320presentation.html
• Geering, H.P. Optimal Control with Engineering Applications, Springer, 2007. ISBN 978-3-540-69437-3
• Ross, I. M. A Primer on Pontryagin's Principle in Optimal Control, Collegiate Publishers, 2009. ISBN 978-0-9843571-0-9.
• Cassel, Kevin W.: Variational Methods with Applications in Science and Engineering, Cambridge University Press, 2013.

External links

• Other Sports Official Kull from Drumheller, has hobbies such as telescopes, property developers in singapore and crocheting. Identified some interesting places having spent 4 months at Saloum Delta.
  
  my web-site http://himerka.com/

• Pontryagin's Principle Illustrated with Examples

fr:Commande optimale#Principe du maximum ru:Оптимальное_управление#Принцип_максимума_Понтрягина

This PNG image was uploaded in a graphics format such as GIF, PNG, JPEG, or SVG. However, it consists purely or largely of information which is better suited to representation in wikitext (possibly using MediaWiki's special syntax for tables, math, or music). This will make the information easier to edit, as well as make it accessible to users of screen readers and text-based browsers. The additional reason provided is: It consists only of mathematical notation. If possible, please replace any inclusions of this image in articles (noted under the "File links" header) with properly formatted wikitext. After doing so, please consider nominating this image for deletion.

Summary

Licensing

Public domainPublic domainfalsefalse

The depicted text is ineligible for copyright and therefore in the public domain because it is not a “literary work” or other protected type in sense of the local copyright law. Facts, data, and unoriginal information which is common property without sufficiently creative authorship in a general typeface or basic handwriting, and simple geometric shapes are not protected by copyright. This tag does not generally apply to all images of texts. Particular countries can have different legal definition of the “literary work” as the subject of copyright and different courts' interpretation practices. Some countries protect almost every written work, while other countries protect distinctively artistic or scientific texts and databases only. Extent of creativeness, function and length of the text can be relevant. The copyright protection can be limited to the literary form – the included information itself can be excluded from protection.

Captions

English

Image for main page with Ackermann function

Items portrayed in this file

depicts

inception

16 July 2004

media type

image/png

checksum

f71ae4075be641235c4cb038ef0b8ed1702b3fa0

determination method: SHA-1

data size

5,922 byte

height

75 pixel

width

512 pixel