Bounded-From-Below Solutions of the Hamilton-Jacobi Equation for Optimal Control Problems with Exit Times: Vanishing Lagrangians, Eikonal Equations, and Shape-From-Shading
Michael Malisoff
Abstract
We study the Hamilton-Jacobi equation for undiscounted exit time control problems with general nonnegative Lagrangians using the dynamic programming approach. We prove theorems characterizing the value function as the unique bounded-from-below viscosity solution of the Hamilton-Jacobi equation which is null on the target. The result applies to problems with the property that all trajectories satisfying a certain integral condition must stay in a bounded set. We allow problems for which the Lagrangian is not uniformly bounded below by positive constants, in which the hypotheses of the known uniqueness results for Hamilton-Jacobi equations are not satisfied. We apply our theorems to eikonal equations from geometric optics, shape-from-shading equations from image processing, and variants of the Fuller Problem.
Create a lesson
Related papers
Risk-Sensitive Stochastic Optimal Control on Positive Cones
Mohamad Al Ahdab, John-Josef Leth
Deterministic Oracle Complexity for Goldstein Stationarity in Nonsmooth Nonconvex Optimization with Constraints
Yixi Ding, Ya-xiang Yuan
Technical Report: Partially Asynchronous Distributed Optimization on Riemannian Manifolds
Adam Pooley, William Warke, Matthew T. Hale
Multi-Step Performance Estimation for Gradient Descent under the Polyak Lojasiewicz Condition
Wanli Hong, Shuyang Ling
Robust Markov Decision Processes: An Introduction Using Convex Optimization and Game Theory
Julien Grand-Clément
Dual-Mode Extremum Seeking for Diffusion Systems with Boundary-Cost Feedback
Martin Guay, Denis Dochain