A forward maximum principle algorithm with decision horizon results (Q1094104)
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 forward maximum principle algorithm with decision horizon results |
scientific article; zbMATH DE number 4024661
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A forward maximum principle algorithm with decision horizon results |
scientific article; zbMATH DE number 4024661 |
Statements
A forward maximum principle algorithm with decision horizon results (English)
0 references
1987
0 references
A discrete optimal control algorithm with separable state constraints \b{x}\({}_ i\leq x_ i\leq \underset {=} x_ i\) is presented. The algorithm uses the fact that at the time of tangency, \(x^*_ t=\underset {=} x_ t\) or \b{x}\({}_ t\), and trajectory for \(0<\tau <t\) is known, other steps of the algorithm adjust the costate. Convergence results are given in a concave case. An application is described informally about energy for residential heating.
0 references
maximum principle algorithm
0 references
optimal scheduling
0 references
shooting algorithms
0 references
energy control
0 references
discrete optimal control algorithm
0 references
separable state constraints
0 references
residential heating
0 references
0 references
0 references
0.85664356
0 references
0.84303856
0 references
0.8318148
0 references
0 references
0.8285587
0 references
0.8285582
0 references
0.8249627
0 references