A multilevel fast marching method for the minimum time problem (Q6640590)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A multilevel fast marching method for the minimum time problem |
scientific article; zbMATH DE number 7946600
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A multilevel fast marching method for the minimum time problem |
scientific article; zbMATH DE number 7946600 |
Statements
A multilevel fast marching method for the minimum time problem (English)
0 references
20 November 2024
0 references
In this paper, the authors investigate a multilevel fast marching method for the minimum time problem. More precisely, they introduce a new numerical method to approximate the solutions of a class of stationary Hamilton-Jacobi (HJ) partial differential equations arising from minimum time optimal control problems.
0 references
Hamilton-Jacobi equations
0 references
minimum time
0 references
fast marching
0 references
eikonal equation
0 references
state constraints
0 references
curse-of-dimensionality
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
