On the Convergence Rate of the Leake-Liu Algorithm for Solving Hamilton-Jacobi-Bellman Equation
Although many iterative algorithms have been proposed for solving Hamilton- Jacobi-Bellman equation arising from nonlinear optimal control, it remains open how fast those algorithms can converge. The convergence rate of those algorithms is of great importance in concluding whether they offer practical benefit. This paper presents a study on how fast the well- known Leake-Liu algorithm in Leake and Liu (1967) can converge. The relationship between the sequence of approximate solutions to the HLB...[Show more]
|Collections||ANU Research Publications|
|Source:||IFAC World Congress 2011 proceedings|
|01_Chen_On_the_Convergence_Rate_of_the_2011.pdf||121.09 kB||Adobe PDF||Request a copy|
|02_Chen_On_the_Convergence_Rate_of_the_2011.pdf||161.29 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.