A Quantitative Approach to Reach-Avoid Reachability Analysis for Discrete-Time Nonlinear Control Systems
Ihab Tabbara, Eliya Badr, Hussein Sibai
A reach-avoid specification requires a dynamical system to reach a target set of states while avoiding a failure set. Reachability analysis partitions the state space into parts starting from which the specification can be satisfied by following some control signal and those from which it cannot despite the best control effort. In this paper, we present a quantitative approach for reachability analysis to analyze the satisfaction of avoid and reach-avoid specifications for discrete-time nonlinear control systems. In such an approach, a value function assigns a value to each state that determines how robustly the system can satisfy the specification starting from it and following the optimal control signal. However, computing such a value function is difficult. Instead, our approach constructs discrete abstractions on which it performs value iteration to compute sound bounds on the desired value function. The resulting lower bound enables a sound under-approximation of the reach avoid set (RAS) and, in the avoid case, a sound over-approximation of the backward reachable set (BRS). When the control set is finite, the upper bound additionally enables a sound over-approximation of the RAS and, in the avoid case, a sound under-approximation of the BRS. The lower bound also yields quantitative guarantees on safety margins and safe target-reaching times. Our approach further refines the abstraction by splitting the grid cells that could not be classified as within or outside the BRS (or RAS) to improve the usefulness of the bounds. We evaluate our approach on five example systems with up to five-dimensional state spaces.
尚无 AI 解读，展示原文摘要