arXiv Analytics

Sign in

arXiv:math/0311269 [math.OC]AbstractReferencesReviewsResources

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

Published 2003-11-16Version 1

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.

Comments: 29 pages, 0 figures, accepted for publication in NoDEA Nonlinear Differential Equations and Applications on July 29, 2002
Journal: NoDEA Nonlinear Differential Equations and Applications, Volume 11, Number 1, pp. 95-122, February 2004
Categories: math.OC
Subjects: 35F20, 49L25
Related articles: Most relevant | Search more
arXiv:1710.07160 [math.OC] (Published 2017-10-19)
Hybrid Thermostatic Approximations of Junctions for some Optimal Control Problems on Networks
arXiv:1506.06172 [math.OC] (Published 2015-06-19)
Stepwise Methods in Optimal Control Problems
arXiv:2001.04906 [math.OC] (Published 2020-01-14)
A unified analytical framework for a class of optimal control problems on networked systems