A double-sided dynamic programming approach to the minimum time problem and its numerical approximation (Q2402561): Difference between revisions
From MaRDI portal
Latest revision as of 08:35, 14 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A double-sided dynamic programming approach to the minimum time problem and its numerical approximation |
scientific article |
Statements
A double-sided dynamic programming approach to the minimum time problem and its numerical approximation (English)
0 references
8 September 2017
0 references
minimum time function
0 references
bridge dynamic programming principle
0 references
semi-Lagrangian discretization
0 references
error estimate
0 references
high order scheme
0 references
semidiscretiaztion
0 references
Hamilton-Jacobi-Bellman equation
0 references
numerical tests
0 references
error comparisons
0 references
0 references
0 references
0 references