A semi-Lagrangian scheme for Lp-penalized minimum time problems - Archive ouverte HAL Access content directly
Conference Papers Year :

A semi-Lagrangian scheme for Lp-penalized minimum time problems

(1) , (2) , (3, 4)
1
2
3
4

Abstract

In this paper we consider a semi-Lagrangian scheme for minimum time problems with Lp-penalization. The minimum time function of the penalized control problem can be characterized as the solution of a Hamilton-Jacobi Bellman (HJB) equation. Furthermore, the minimum time converges with respect to the penalization parameter to the minimum time of the non-penalized problem. To solve the control problem we formulate the discrete dynamic programming principle and set up a semi-Lagrangian scheme. Various numerical examples are presented studying the effects of different choices of the penalization parameters.
Fichier principal
Vignette du fichier
FalconeKaliseKroener2014.pdf (917.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01089877 , version 1 (02-04-2015)

Identifiers

  • HAL Id : hal-01089877 , version 1

Cite

Maurizio Falcone, Dante Kalise, Axel Kröner. A semi-Lagrangian scheme for Lp-penalized minimum time problems. 21st International Symposium on Mathematical Theory of Networks and Systems, Jul 2014, Groningen, Netherlands. ⟨hal-01089877⟩
243 View
130 Download

Share

Gmail Facebook Twitter LinkedIn More