Can Local Single-Pass Methods Solve Any Stationary Hamilton--Jacobi--Bellman Equation?

DOI10.1137/130907707zbMath1296.65094arXiv1301.6775OpenAlexW2051261506MaRDI QIDQ2874996

Simone Cacace, Emiliano Cristiani, Maurizio Falcone

Publication date: 13 August 2014

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.6775

zbMATH Keywords

algorithmnumerical examplesHamilton-Jacobi equationssemi-Lagrangian schemeseikonal equationnumerical testfast sweeping methodsfast marching methodslocal single-pass methods

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Dynamic programming in optimal control and differential games (49L20) Existence theories for optimal control problems involving partial differential equations (49J20) Hamilton-Jacobi equations (35F21)

Related Items (9)

Neighbor-gradient single-pass method for solving anisotropic eikonal equation ⋮ A Dijkstra-type algorithm for dynamic games ⋮ A fast single-pass method for solving the generalized eikonal equation in a moving medium ⋮ An all-densities pedestrian simulator based on a dynamic evaluation of the interpersonal distances ⋮ Parallel solutions of static Hamilton-Jacobi equations for simulations of geological folds ⋮ Fast and accurate surface normal integration on non-rectangular domains ⋮ Handling obstacles in pedestrian simulations: models and optimization ⋮ Riemannian Fast-Marching on Cartesian Grids, Using Voronoi's First Reduction of Quadratic Forms ⋮ Modeling Rationality to Control Self-Organization of Crowds: An Environmental Approach

This page was built for publication: Can Local Single-Pass Methods Solve Any Stationary Hamilton--Jacobi--Bellman Equation?