Probabilistic Reach-Avoid Reachability in Nondeterministic Systems with Time-VaryingTargets and Obstacles

TL;DR

This paper introduces a generalized approach for probabilistic reachability in nondeterministic systems with time-varying targets and obstacles, providing a numerical method to compute and control such systems effectively.

Contribution

It extends existing probabilistic reachability definitions to include time-varying targets and obstacles, and proposes a numerical method for computing and controlling these sets.

Findings

The scalar function accurately represents probabilistic reachable sets.

The method effectively handles time-varying targets and obstacles.

Examples demonstrate the method's validity and accuracy.

Abstract

The probabilistic reachability problems of nondeterministic systems are studied. Based on the existing studies, the definition of probabilistic reachable sets is generalized by taking into account time-varying target set and obstacle. A numerical method is proposed to compute probabilistic reachable sets. First, a scalar function in the state space is constructed by backward recursion and grid interpolation, and then the probability reachable set is represented as a nonzero level set of this scalar function. In addition, based on the constructed scalar function, the optimal control policy can be designed. At the end of this paper, some examples are taken to illustrate the validity and accuracy of the proposed method.