A semi-Lagrangian scheme for Lp-penalized minimum time problems
Overview & Synopsis
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.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | A semi-Lagrangian scheme for Lp-penalized minimum time problems |
|---|---|
| Author / Organization | Maurizio Falcone, Dante Kalise, Axel Kröner |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2014 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-53594 |
| Original Source Link | Visit Source Page on hal.science » |