We study safety verification for linear time-invariant systems with bounded inputs in continuous time. The standard approach reduces to a reachability analysis in two steps: first discretize time and then apply a forward analysis in the discretized system. Existing algorithms use either a fixed time step or an adaptive time step that changes based on the approximation error compared to the underlying continuous system. In this paper, we present an efficient reachability algorithm that adapts the time step based on a given safety property. Essentially, our algorithm makes the largest possible time step such that it can still prove safety. For this approach to be scalable in practice, we discuss several optimizations such as avoiding the repeated expensive calculation of the matrix exponential during discretization and a careful balance how we tame the approximation error stemming from the states and the inputs. This allows our algorithm to yield a moderate approximation error even when using a large time step, thus requiring much fewer steps than prior algorithms. We demonstrate the effectiveness and scalability on the large-scale SLICOT benchmark suite, where our algorithm consistently outperforms other state-of-the-art approaches.
Safe and Performant Deployment of Autonomous Systems via Model Predictive Control and Hamilton-Jacobi Reachability Analysis
Department of Electrical and Computer Engineering, University of Southern California(电气与计算机工程系,南加州大学);Department of Aeronautics and Astronautics, Stanford University(航空与航天系,斯坦福大学);Electrical and Computer Engineering Department, New York University(电气与计算机工程系,纽约大学)
NeuroHJR: Hamilton-Jacobi Reachability-based Obstacle Avoidance in Complex Environments with Physics-Informed Neural Networks
Department of Physical Science, Indian Institute of Science Education and Research(物理科学系,印度科学教育与研究学院);Department of Aerospace Engineering, Indian Institute of Science(航空航天工程系,印度科学研究院);Department of Computer Science and Engineering, Shiv Nadar University(计算机科学与工程系,施瓦斯纳大学)