A proof of Pontryagin's minimum principle using dynamic programming (Q1206934)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A proof of Pontryagin's minimum principle using dynamic programming |
scientific article; zbMATH DE number 150667
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A proof of Pontryagin's minimum principle using dynamic programming |
scientific article; zbMATH DE number 150667 |
Statements
A proof of Pontryagin's minimum principle using dynamic programming (English)
0 references
1 April 1993
0 references
The author proves the Pontryagin's Minimum Principle for a fixed-time optimal control problem without end-point constraints using a dynamic programming approach. The proof replaces the result which states that the value function is a continuous viscosity subsolution of the Hamilton- Jacobi-Bellman equation by two other results. It is pointed out that his proof is easier than others known in the literature.
0 references
Pontryagin's Minimum Principle
0 references
fixed-time optimal control
0 references
continuous viscosity subsolution
0 references
Hamilton-Jacobi-Bellman equation
0 references
0 references
