An improvement algorithm based on local approximation of the attainable set.

MaRDI QIDQ2764323zbMATH OpenFDO

Authors Elena Goncharova, N. V. Pochinskaya, V. A. Baturin

Publication date 3 July 2002

Published in Matematicheskoe Modelirovanie (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/mm/v13/i6/p23

zbMATH Keywords

optimal controlreachable setBellman equationlocal approximation

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Attainable sets, reachability (93B03) Nonlinear systems in control theory (93C10)

Recommendations

• An improvement method based on an approximate representation of the attainable set. A relaxation theorem
• A grid-based algorithm for constructing attainability sets with improved boundary approximation
• scientific article; zbMATH DE number 3219396
• A method of approximating an attainable set for a differential inclusion
• Vector optimization using improvement sets in locally convex spaces
• scientific article; zbMATH DE number 5159135
• scientific article; zbMATH DE number 4183191
• Low order polynomial bounds on the expected performance of local improvement algorithms
• scientific article; zbMATH DE number 1530351
• Set optimization using improvement sets

Cited in

(4)

• A grid-based algorithm for constructing attainability sets with improved boundary approximation
• An optimal control algorithm based on reachability set approximation and linearization
• Improvement algorithms for discrete-time control systems based on the extension and localization principles
• An improvement method based on an approximate representation of the attainable set. A relaxation theorem

This page was built for publication: An improvement algorithm based on local approximation of the attainable set.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2764323)