A double-sided dynamic programming approach to the minimum time problem and its numerical approximation
DOI10.1016/j.apnum.2017.06.008zbMath1372.65193OpenAlexW2729973146MaRDI QIDQ2402561
Publication date: 8 September 2017
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2017.06.008
Hamilton-Jacobi-Bellman equationnumerical testserror estimateminimum time functionhigh order schemesemi-Lagrangian discretizationsemidiscretiaztionbridge dynamic programming principleerror comparisons
Numerical optimization and variational techniques (65K10) Dynamic programming in optimal control and differential games (49L20) Existence theories for optimal control problems involving partial differential equations (49J20) Discrete approximations in optimal control (49M25) Hamilton-Jacobi equations (35F21)
Related Items
Cites Work
- Unnamed Item
- Higher order discrete controllability and the approximation of the minimum time function
- Discrete time high-order schemes for viscosity solutions of Hamilton- Jacobi-Bellman equations
- Higher-order approximations of linear control systems via Runge-Kutta schemes
- Second order conditions for the controllability of nonlinear systems with drift
- An Approximation Scheme for the Minimum Time Function
- Controllability of Some Nonlinear Systems with Drift via Generalized Curvature Properties
- Semi-Lagrangian Approximation Schemes for Linear and Hamilton—Jacobi Equations
- Small-time local attainability for a class of control systems with state constraints
- Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations
- Higher order numerical schemes for affinely controlled nonlinear systems