Related Directory Categories
- Control Theory (71)
- Institutions (23)
- Journals (10)
- Events (8)
- Past Events (7)
- Associations (5)
- Lagrangian and Hamiltonian Mechanics (4)
- People (2)
Sources
Help build the largest human-edited directory on the web.
Submit a site - Become an editor
Wikipedia. Licensed under the GNU Free Documentation License.
Are you an expert in this subject? Join the discussion and share your knowledge at Wikipedia.org.
Hamiltonian (control theory)
From Wikipedia, the free encyclopedia
The Hamiltonian of optimal control theory was developed by L. S. Pontryagin as part of his minimum principle. It was inspired by, but is distinct from, the Hamiltonian of classical mechanics. Pontryagin proved that a necessary condition for solving the optimal control problem is that the control should be chosen so as to minimize the Hamiltonian.
Contents |
A control u(t) is to be chosen so as to minimize the objective function:
The system state x(t) evolves according to the state equations
![\dot{x}=f(x,u,t) \qquad x(0)=x_0 \quad t \in [0,T]](../../../math/d/a/9/da94a0c2c4d41239da1a75f860378e99.png)
the control must satisfy the constraints
![a \le u(t) \le b \quad t \in [0,T]](../../../math/e/f/f/effbb88d89d5bd9964309d744a3faf54.png)
(in later work it was shown that constraints on the state could also be imposed, these will be left out of our presentation)
For the problem above the Hamiltonian is
where λ(t) is a vector of costate variables of the same dimension as the state variables x(t).
The state variables satisfy
subject to the initial condition x(0) = x0. (It can be easily verified that this is exactly equivalent to the state equations given above).
The costate variables satisfy the costate equations
subject to the terminal condition
Let x * (t) and λ * (t) denote the optimal state and costate trajectories respectively, then at each point in time t the optimal control u * (t) minimizes the Hamiltonian as compared to any other control u(t) satifying the control constraints:
(Note that, although at first sight the minimum principle gives a recipe for finding u * (t), that recipe is somewhat circular since the above expression uses x * (t) and λ * (t), the optimal state and costate, which presupposes a knowledge of the optimal solution! One way around this problem is to iterate the three equations above: starting from a trial u(t) compute the associated state via the first equation, then compute the costate via the second equation, then find an improved u(t) by applying the minimum principle with the current state and costate (rather than the optimal ones). One can then repeat the process until convergence).
When the problem is formulated in discrete time, the Hamiltonian is defined as:
and the costate equations are
(Note that the discrete time Hamiltonian at time t involves the costate variable at time t + 1. This small detail is essential so that when we differentiate with respect to x we get a term involving λ(t + 1) on the right hand side of the costate equations. Using a wrong convention here can lead to incorrect results, i.e. a costate equation which is not a backwards difference equation).