A Computationally Efficient Hamilton-Jacobi-based Formula for State-Constrained Optimal Control Problems
This paper investigates a Hamilton-Jacobi (HJ) analysis to solve finite-horizon optimal control problems for high-dimensional systems. Although grid-based methods, such as the level-set method [1], numerically solve a general class of HJ partial differential equations, the computational complexity is exponential in the dimension of the continuous state. To manage this computational complexity, methods based on Lax-Hopf theory have been developed for the state-unconstrained optimal control problem under certain assumptions, such as affine dynamics and state-independent stage cost. Based on the Lax formula [2], this paper proposes an HJ formula for the state-constrained optimal control problem for nonlinear systems. We call this formula \textit{the generalized Lax formula} for the optimal control problem. The HJ formula provides both the optimal cost and an optimal control signal. We also provide an efficient computational method for a class of problems for which the dynamics is affine in the state, and for which the stage and terminal cost, as well as the state constraints, are convex in the state. This class of problems does not require affine dynamics and convex stage cost in the control. This paper also provides three practical examples.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Neural Implicit Solution Formula for Efficiently Solving Hamilton-Jacobi Equations
This paper presents an implicit solution formula for the Hamilton-Jacobi partial differential equation (HJ PDE). The formula is derived using the method of characteristics and is shown to coincide with the Hopf and Lax f…
Computational EfficiencyConservative Linear Envelopes for Nonlinear, High-Dimensional, Hamilton-Jacobi Reachability
Hamilton-Jacobi reachability (HJR) provides a value function that encodes the set of states from which a system with bounded control inputs can reach or avoid a target despite any bounded disturbance, and the correspondi…
On Hamilton-Jacobi PDEs and image denoising models with certain non-additive noise
We consider image denoising problems formulated as variational problems. It is known that Hamilton-Jacobi PDEs govern the solution of such optimization problems when the noise model is additive. In this work, we address …
DenoisingImage DenoisingValuation of European Options under an Uncertain Market Price of Volatility Risk
We propose a model to quantify the effect of parameter uncertainty on the option price in the Heston model. More precisely, we present a Hamilton-Jacobi-Bellman framework which allows us to evaluate best and worst case s…
Uncertainty QuantificationConnecting Hamilton--Jacobi partial differential equations with maximum a posteriori and posterior mean estimators for some non-convex priors
Many imaging problems can be formulated as inverse problems expressed as finite-dimensional optimization problems. These optimization problems generally consist of minimizing the sum of a data fidelity and regularization…