Galerkin approximations of the generalized Hamilton-Jacobi-Bellman equation
نویسندگان
چکیده
In this paper we study the convergence of the Galerkin approximation method applied to the Generalized Hamilton-Jacobi-Bellman (GHJB) equation over a compact set containing the origin. The GHJB equation gives the cost of an arbitrary control law and can be used to improve the performance of this control. The GHJB equation can also be used to successively approximate the Hamilton-Jacobi-Bellman equation. We state suucient conditions that guarantee that the Galerkin approximation converges to the solution of the GHJB equation and that the resulting approximate control is stabilizing on the same region as the initial control. The method is demonstrated on a simple nonlinear system and is compared to a result obtained by using exact feedback linearization in conjunction with the LQR design method.
منابع مشابه
Galerkin Approximation of the Generalized Hamilton-jacobi Equation
If u is a stabilizing control for a nonlinear system that is aane in the control variable, then the solution to the Generalized Hamilton-Jacobi-Bellman (GHJB) equation associated with u is a Lyapunov function for the system and equals the cost associated with u. If an explicit solution to the GHJB equation can be found then it can be used to construct a feedback control law that improves the pe...
متن کاملSuccessive Galerkin Approximations to the Nonlinear Optimal Control of an Underwater Robotic Vehicle
The application of a new nonlinear optimal control strategy to the station-keeping control of an underwater robotic vehicle is considered. The control approach described and demonstrated here is based upon the numerical approximation of solutions to the Hamilton-Jacobi-Bellman equation. These solutions are computed by an iterative application of a Galerkin-type method. Preliminary simulation re...
متن کاملNumerically Eecient Approximations to the Hamilton-jacobi-bellman Equation
In this paper we present an implementation of the Successive Galerkin Approximation (SGA) algorithm to the Hamilton-Jacobi-Bellman (HJB) equation which is less sensitive to Bellman's curse of dimensionality. The SGA algorithm takes an arbitrary stabilizing control law and improves the performance of the control law. Until now the SGA algorithm could only be applied to low order systems. An elem...
متن کاملApproximations to Optimal Feedback Control Using a Successive Wavelet Collocation Algorithm
Wavelets, which have many good properties such as time/freqency localization and compact support, are considered for solving the Hamilton-Jacobi-Bellman (HJB) equation as appears in optimal control problems. Specifically, we propose a Successive Wavelet Collocation Algorithm (SWCA) that uses interpolating wavelets in a collocation scheme to iteratively solve the Generalized-Hamilton-Jacobi-Bell...
متن کاملSub-Optimal Feedback Control Using a Successive Wavelet-Galerkin Algorithm
We present a numerical algorithm for solving the Hamilton-Jacobi Bellman equation using a successive Galerkin-wavelet projection scheme. According to this scheme, the so-called Generalized-HamiltonJacobi-Bellman (GHJB) equation is solved iteratively starting from a stabilizing solution. As basis function for the Galerkin projections we consider the antiderivatives of the well-known Daubechies’ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Automatica
دوره 33 شماره
صفحات -
تاریخ انتشار 1997