Can local single-pass methods solve any stationary Hamilton-Jacobi-Bellman equation?

Abstract

The use of local single-pass methods (like, e.g., the Fast Marching method) has become popular in the solution of some Hamilton-Jacobi equations. The prototype of these equations is the eikonal equation, for which the methods can be applied saving CPU time and possibly memory allocation. Then, some natural questions arise: can local single-pass methods solve any Hamilton-Jacobi equation? If not, where the limit should be set? This paper tries to answer these questions. In order to give a complete picture, we present an overview of some fast methods available in literature and we briefly analyze their main features. We also introduce some numerical tools and provide several numerical tests which are intended to exhibit the limitations of the methods. We show that the construction of a local single-pass method for general Hamilton-Jacobi equations is very hard, if not impossible. Nevertheless, some special classes of problems can be actually solved, making local single-pass methods very useful from the practical point of view.

19 pages

Cited by in corpus (8)

• Modeling rationality to control self-organization of crowds: An environmental approach
• Handling obstacles in pedestrian simulations: models and optimization
• An all-densities pedestrian simulator based on a dynamic evaluation of the interpersonal distances
• A generalized mean-field game model for the dynamics of pedestrians with limited predictive abilities
• A dynamic domain decomposition for a class of second order semi-linear equations
• Fast and Accurate Surface Normal Integration on Non-Rectangular Domains
• Two semi-Lagrangian fast methods for Hamilton-Jacobi-Bellman equations
• An Efficient Policy Iteration Algorithm for Dynamic Programming Equations