Overapproximating Reachable Sets by Hamilton-Jacobi Projections

  • Authors:

  • Ian M. Mitchell;Claire J. Tomlin

  • Affiliations:

  • Scientific Computing and Computational Mathematics Program, Stanford University, Stanford, California 94305. mitchell@sccm.stanford.edu;Department of Aeronautics and Astronautics, Stanford University, Stanford, California 94305. tomlin@stanford.edu

  • Venue:
  • Journal of Scientific Computing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In earlier work, we showed that the set of states which can reach a target set of a continuous dynamic game is the zero sublevel set of the viscosity solution of a time dependent Hamilton-Jacobi-Isaacs (HJI) partial differential equation (PDE). We have developed a numerical tool—based on the level set methods of Osher and Sethian—for computing these sets, and we can accurately calculate them for a range of continuous and hybrid systems in which control inputs are pitted against disturbance inputs. The cost of our algorithm, like that of all convergent numerical schemes, increases exponentially with the dimension of the state space. In this paper, we devise and implement a method that projects the true reachable set of a high dimensional system into a collection of lower dimensional subspaces where computation is less expensive. We formulate a method to evolve the lower dimensional reachable sets such that they are each an overapproximation of the full reachable set, and thus their intersection will also be an overapproximation of the reachable set. The method uses a lower dimensional HJI PDE for each projection with a set of disturbance inputs augmented with the unmodeled dimensions of that projection's subspace. We illustrate our method on two examples in three dimensions using two dimensional projections, and we discuss issues related to the selection of appropriate projection subspaces.