Calculus of variations and optimal control; optimization Optimal control: formulation and existence Problem
Mayer and Lagrange problems
Builds on Optimal controlControl systemAdmissible controlFunctional
Problem
Let be a nonempty set, and let be fixed times. Let be continuous, and let be a closed set of allowed endpoint pairs. An admissible control is a measurable map whose trajectory of the control system is absolutely continuous on and satisfies .
- The Mayer problem: given a continuous function , minimize over all admissible controls .
- The Lagrange problem: given a continuous function , minimize the functional over all admissible controls .
Remarks
The Mayer problem has only an endpoint cost, and the Lagrange problem has only a running cost. Both are special cases of the Bolza problem, whose cost is the sum of the two. They are equivalent to each other. A Lagrange problem becomes a Mayer problem with the extra state , , and the endpoint cost . A Mayer problem with of class that depends only on , and a fixed initial state , becomes a Lagrange problem with , since . The Mayer form is convenient for existence proofs and for geometric arguments with reachable sets. The Lagrange form is the classical form of the calculus of variations.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Admissible control concept
- Control system concept
- Functional concept
- Optimal control concept
- Mayer and Lagrange problems problem
Where this leads
3 pages build on this one.
Further reading
About this page
| Tag | 1J8TYT7C49 |
|---|---|
| URI | m2://1J8TYT7C49 |
| Kind | problem |
| Writing | W0 stub |
| MSC | 49K15, 49J15 |
| Status | This copy of the site has no build data. Run m2 status 1J8TYT7C49. |
| About | Optimal control |
| Uses | Optimal control, Control system, Admissible control, Functional |
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.