Two Semi-Lagrangian Fast Methods for Hamilton-Jacobi-Bellman Equations

Abstract : In this paper we apply the Fast Iterative Method (FIM) for solving general Hamilton–Jacobi–Bellman (HJB) equations and we compare the results with an accelerated version of the Fast Sweeping Method (FSM). We find that FIM can be indeed used to solve HJB equations with no relevant modifications with respect to the original algorithm proposed for the eikonal equation, and that it overcomes FSM in many cases. Observing the evolution of the active list of nodes for FIM, we recover another numerical validation of the arguments recently discussed in [1] about the impossibility of creating local single-pass methods for HJB equations.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-01286401
Contributor : Hal Ifip <>
Submitted on : Thursday, March 10, 2016 - 5:13:18 PM
Last modification on : Friday, December 1, 2017 - 1:12:49 AM
Long-term archiving on : Sunday, November 13, 2016 - 3:07:58 PM

File

978-3-662-45504-3_7_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

Citation

Simone Cacace, Emiliano Cristiani, Maurizio Falcone. Two Semi-Lagrangian Fast Methods for Hamilton-Jacobi-Bellman Equations. 26th Conference on System Modeling and Optimization (CSMO), Sep 2013, Klagenfurt, Austria. pp.74-84, ⟨10.1007/978-3-662-45504-3_7⟩. ⟨hal-01286401⟩

Share

Metrics

Record views

41

Files downloads

136