Skip to Main content Skip to Navigation
Journal articles

An Efficient Policy Iteration Algorithm for Dynamic Programming Equations

Abstract : We present an accelerated algorithm for the solution of static Hamilton-Jacobi-Bellman equations related to optimal control problems. Our scheme is based on a classic policy iteration procedure, which is known to have superlinear convergence in many relevant cases provided the initial guess is sufficiently close to the solution. In many cases, this limitation degenerates into a behavior similar to a value iteration method, with an increased computation time. The new scheme circumvents this problem by combining the advantages of both algorithms with an efficient coupling. The method starts with a value iteration phase and then switches to a policy iteration procedure when a certain error threshold is reached. A delicate point is to determine this threshold in order to avoid cumbersome computation with the value iteration and, at the same time, to be reasonably sure that the policy iteration method will finally converge to the optimal solution. We analyze the methods and efficient coupling in a number of examples in dimension two, three and four illustrating its properties.
Complete list of metadata
Contributor : Estelle Bouzat Connect in order to contact the contributor
Submitted on : Thursday, September 25, 2014 - 1:47:28 PM
Last modification on : Wednesday, November 3, 2021 - 2:18:08 PM

Links full text




Alessandro Alla, Maurizio Falcone, Dante Kalise. An Efficient Policy Iteration Algorithm for Dynamic Programming Equations. SIAM Journal on Scientific Computing, Society for Industrial and Applied Mathematics, 2015, 37 (1), pp.A181-A200. ⟨10.1137/130932284⟩. ⟨hal-01068295⟩



Record views