Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userComputation of Reachable Sets Based on Hamilton-Jacobi-Bellman Equation with Running Cost Function
69
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
A novel method for computing reachable sets is proposed in this paper. In the proposed method, a Hamilton-Jacobi-Bellman equation with running cost functionis numerically solved and the reachable sets of different time horizons are characterized by a family of non-zero level sets of the solution of the Hamilton-Jacobi-Bellman equation. In addition to the classical reachable set, by setting different running cost functions and terminal conditionsof the Hamilton-Jacobi-Bellman equation, the proposed method allows to compute more generalized reachable sets, which are referred to as cost-limited reachable sets. In order to overcome the difficulty of solving the Hamilton-Jacobi-Bellman equation caused by the discontinuity of the solution, a method based on recursion and grid interpolation is employed. At the end of this paper, some examples are taken to illustrate the validity and generality of the proposed method.
rate research
Read More
This paper presents an iterative algorithm to compute a Robust Control Invariant (RCI) set, along with an invariance-inducing control law, for Linear Parameter-Varying (LPV) systems. As the real-time measurements of the scheduling parameters are typically available, in the presented formulation, we allow the RCI set description along with the invariance-inducing controller to be scheduling parameter dependent. The considered formulation thus leads to parameter-dependent conditions for the set invariance, which are replaced by sufficient Linear Matrix Inequality (LMI) conditions via Polyas relaxation. These LMI conditions are then combined with a novel volume maximization approach in a Semidefinite Programming (SDP) problem, which aims at computing the desirably large RCI set. In addition to ensuring invariance, it is also possible to guarantee performance within the RCI set by imposing a chosen quadratic performance level as an additional constraint in the SDP problem. The reported numerical example shows that the presented iterative algorithm can generate invariant sets which are larger than the maximal RCI sets computed without exploiting scheduling parameter information.
In this paper, we study a stochastic recursive optimal control problem in which the value functional is defined by the solution of a backward stochastic differential equation (BSDE) under $tilde{G}$-expectation. Under standard assumptions, we establish the comparison theorem for this kind of BSDE and give a novel and simple method to obtain the dynamic programming principle. Finally, we prove that the value function is the unique viscosity solution of a type of fully nonlinear HJB equation.
We prove existence and uniqueness of Crandall-Lions viscosity solutions of Hamilton-Jacobi-Bellman equations in the space of continuous paths, associated to the optimal control of path-dependent SDEs. This seems the first uniqueness result in such a context. More precisely, similarly to the seminal paper of P.L. Lions, the proof of our core result, that is the comparison theorem, is based on the fact that the value function is bigger than any viscosity subsolution and smaller than any viscosity supersolution. Such a result, coupled with the proof that the value function is a viscosity solution (based on the dynamic programming principle, which we prove), implies that the value function is the unique viscosity solution to the Hamilton-Jacobi-Bellman equation. The proof of the comparison theorem in P.L. Lions paper, relies on regularity results which are missing in the present infinite-dimensional context, as well as on the local compactness of the finite-dimensional underlying space. We overcome such non-trivial technical difficulties introducing a suitable approximating procedure and a smooth gauge-type function, which allows to generate maxima and minima through an appropriate version of the Borwein-Preiss generalization of Ekelands variational principle on the space of continuous paths.
Zonotopes are widely used for over-approximating forward reachable sets of uncertain linear systems. In this paper, we use zonotopes to achieve more scalable algorithms that under-approximate backward reachable sets for uncertain linear systems. The main difference is that the backward reachability analysis is a two-player game and involves Minkowski difference operations, but zonotopes are not closed under such operations. We under-approximate this Minkowski difference with a zonotope, which can be obtained by solving a linear optimization problem. We further develop an efficient zonotope order reduction technique to bound the complexity of the obtained zonotopic under-approximations. The proposed approach is evaluated against existing approaches using randomly generated instances, and illustrated with an aircraft position control system.
Policy iteration is a widely used technique to solve the Hamilton Jacobi Bellman (HJB) equation, which arises from nonlinear optimal feedback control theory. Its convergence analysis has attracted much attention in the unconstrained case. Here we analyze the case with control constraints both for the HJB equations which arise in deterministic and in stochastic control cases. The linear equations in each iteration step are solved by an implicit upwind scheme. Numerical examples are conducted to solve the HJB equation with control constraints and comparisons are shown with the unconstrained cases.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
