๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Method of successive approximations for solution of optimal control problems

โœ Scribed by F. L. Chernousko; A. A. Lyubushin

Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
771 KB
Volume
3
Category
Article
ISSN
0143-2087

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Successive approximation methods for the
Successive approximation methods for the solution of optimal control problems
โœ S.K. Mitter ๐Ÿ“‚ Article ๐Ÿ“… 1966 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 801 KB

IN THIS paper we present some successive approximation methods for the solution of a general class of optimal control problems. The class of problems considered is known as the Bolxa Problem in the Calculus of Variations [l]. The algorithms considered are extensions of the gradient methods due to KE

Eigenvector approximate dichotomic basis
Eigenvector approximate dichotomic basis method for solving hyper-sensitive optimal control problems
โœ Anil V. Rao; Kenneth D. Mease ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 204 KB

The dichotomic basis method is further developed for solving completely hyper-sensitive Hamiltonian boundary value problems arising in optimal control. For this class of problems, the solution can be accurately approximated by concatenating an initial boundary-layer segment, an equilibrium segment,