Computation of Reachable Sets Based on Hamilton-Jacobi-Bellman Equation with Running Cost Function

A novel method for computing reachable sets is proposed in this paper. In the proposed method, a Hamilton-Jacobi-Bellman equation with running cost function is 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 conditions of 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.

Computation of Reachable Sets Based on Hamilton-Jacobi-Bellman Equation with Running Cost Function

A novel method for computing reachable sets is proposed in this paper. In the proposed method, a Hamilton-Jacobi-Bellman equation with running cost function is 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 conditions of 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.

On the convexity of the reachable set with respect to a part of coordinates at small time intervals

We investigate the convexity of the reachable sets for some of the coordinates of nonlinear systems with integral constraints on the control at small time intervals. We have proved sufficient convexity conditions in the form of constraints on the asymptotics of the eigenvalues of the Gramian of the controllability of a linearized system for some of the coordinates. There are two nonlinear third-order systems under study as examples. The system linearized along a trajectory generated by zero control is uncontrollable, and the system in the other example is completely controllable. We investigate the sufficient conditions for convexity of projection of reachable sets. Numerical modeling has been carried out, demonstrating the non-convexity of some projections even for small time intervals.