The problem considered is that of approximate numerical minimisation of the non-linear control problem of Bolza. Starting from the classical dynamic programming method of Bellman, an ε-value function is defined as an approximation for the value function being a solution to the Hamilton-Jacobi equation. The paper shows how an ε-value function which maintains suitable properties analogous to the original Hamilton-Jacobi value function can be constructed using a stable numerical algorithm. The paper shows the numerical closeness of the approximate minimum to the infimum of the Bolza functional.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
The problem considered is that of approximate minimisation of the Bolza problem of optimal control. Starting from Bellman's method of dynamic programming, we define the ε-value function to be an approximation to the value function being a solution to the Hamilton-Jacobi equation. The paper shows an approach that can be used to construct an algorithm for calculating the values of an ε-value function at given points, thus approximating the respective values of the value function.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.