in the repository
Title data
Grüne, Lars ; Le, Thuy Thi Thien:
A new approach to the minimum time problem and its numerical approximation.
Department of Mathematics, University of Bayreuth
Bayreuth
,
2015
. - 17 S.
![[thumbnail of Gruene_et_al_new_approach_min_time_prob_2015.pdf]](https://epub.uni-bayreuth.de/style/images/fileicons/application_pdf.png) |
|
||||||||
|
Download (1MB)
|
Project information
| Project financing: |
Università di Padova, Fondazione CARIPARO |
|---|
Abstract
We introduce a new formulation of the minimum time problem in which we employ the signed minimum time function positive outside of the target, negative in its interior and zero on its boundary. Under some standard assumptions, we prove the so called Bridge Dynamic Programming Principle (BDPP) which is a relation between the value functions defined on the complement of the target and in its interior. Then owing to BDPP, we obtain the error estimates of a semi-Lagrangian discretization of the resulting Hamilton-Jacobi-Bellman equation. In the end, we provide numerical tests and error comparisons which show that the new approach can lead to significantly reduced numerical errors.
Download Statistics