An improvement algorithm based on local approximation of the attainable set. (Q2764323)
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: An improvement algorithm based on local approximation of the attainable set. |
scientific article; zbMATH DE number 1690332
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improvement algorithm based on local approximation of the attainable set. |
scientific article; zbMATH DE number 1690332 |
Statements
3 July 2002
0 references
local approximation
0 references
Bellman equation
0 references
reachable set
0 references
optimal control
0 references
0.87213063
0 references
0.84038633
0 references
0 references
0.82777345
0 references
0.8233786
0 references
0.82265174
0 references
An improvement algorithm based on local approximation of the attainable set. (English)
0 references
Nonlinear, finite-dimensional, nonstationary, continuous-time control systems are considered. Using a solution of the Bellman equation and based on an approximate representation of the reachable set, certain algorithms for optimal control problems are proposed and discussed. Moreover, several remarks and comments are given. Relationships to results existing in the literature are also mentioned. A simple numerical example which illustrates the theoretical considerations and the usefulnes of the proposed algorithm is also presented.
0 references
