English
Related papers

Related papers: Generating Formal Safety Assurances for High-Dimen…

200 papers

The proven efficacy of learning-based control schemes strongly motivates their application to robotic systems operating in the physical world. However, guaranteeing correct operation during the learning process is currently an unresolved…

Hamilton-Jacobi reachability methods for safety-critical control have been well studied, but the safety guarantees derived rely on the accuracy of the numerical computation. Thus, it is crucial to understand and account for any inaccuracies…

Systems and Control · Electrical Eng. & Systems 2022-12-15 Nikolaus Vertovec , Sina Ober-Blöbaum , Kostas Margellos

Recent developments in autonomous driving and robotics underscore the necessity of safety-critical controllers. Control barrier functions (CBFs) are a popular method for appending safety guarantees to a general control framework, but they…

Robotics · Computer Science 2025-05-21 Matthew Kim , William Sharpless , Hyun Joe Jeong , Sander Tonkens , Somil Bansal , Sylvia Herbert

Safe value functions, such as control barrier functions, characterize a safe set and synthesize a safety filter, overriding unsafe actions, for a dynamic system. While function approximators like neural networks can synthesize approximately…

Robotics · Computer Science 2024-09-10 Sander Tonkens , Alex Toofanian , Zhizhen Qin , Sicun Gao , Sylvia Herbert

Reachability analysis provides formal guarantees for performance and safety properties of nonlinear control systems. Here, one aims to compute the backward reachable set (BRS) or tube (BRT) -- the set of states from which the system can be…

Optimization and Control · Mathematics 2017-07-18 Mo Chen , Sylvia L. Herbert , Mahesh S. Vashishtha , Somil Bansal , Claire J. Tomlin

We present ProbReach, a tool for verifying probabilistic reachability for stochastic hybrid systems, i.e., computing the probability that the system reaches an unsafe region of the state space. In particular, ProbReach will compute an…

Logic in Computer Science · Computer Science 2015-03-06 Fedor Shmarov , Paolo Zuliani

Hamilton-Jacobi Reachability (HJR) analysis has been successfully used in many robotics and control tasks, and is especially effective in computing reach-avoid sets and control laws that enable an agent to reach a goal while satisfying…

Robotics · Computer Science 2026-02-03 Zheng Gong , Boyang Li , Sylvia Herbert

We develop an algorithm for computing bounded reachability probability for hybrid systems, i.e., the probability that the system reaches an unsafe region within a finite number of discrete transitions. In particular, we focus on hybrid…

Logic in Computer Science · Computer Science 2015-05-13 Fedor Shmarov , Paolo Zuliani

Safe Multi-Agent Motion Planning (MAMP) is a significant challenge in robotics. Despite substantial advancements, existing methods often face a dilemma. Decentralized algorithms typically rely on predicting the behavior of other agents,…

Robotics · Computer Science 2025-07-21 Qingyi Chen , Ahmed H. Qureshi

We present a method to compute the stochastic reachability safety probabilities for high-dimensional stochastic dynamical systems. Our approach takes advantage of a nonparametric learning technique known as conditional distribution…

Systems and Control · Electrical Eng. & Systems 2020-10-19 Adam J. Thorpe , Vignesh Sivaramakrishnan , Meeko M. K. Oishi

To sidestep the curse of dimensionality when computing solutions to Hamilton-Jacobi-Bellman partial differential equations (HJB PDE), we propose an algorithm that leverages a neural network to approximate the value function. We show that…

Machine Learning · Computer Science 2017-03-28 Frank Jiang , Glen Chou , Mo Chen , Claire J. Tomlin

Real-world autonomous systems often employ probabilistic predictive models of human behavior during planning to reason about their future motion. Since accurately modeling human behavior a priori is challenging, such models are often…

Robotics · Computer Science 2020-04-07 Somil Bansal , Andrea Bajcsy , Ellis Ratner , Anca D. Dragan , Claire J. Tomlin

Provably safe and scalable multi-vehicle path planning is an important and urgent problem due to the expected increase of automation in civilian airspace in the near future. Hamilton-Jacobi (HJ) reachability is an ideal tool for analyzing…

Systems and Control · Computer Science 2017-05-15 Mo Chen , Somil Bansal , Ken Tanabe , Claire J. Tomlin

Multi-UAV systems are safety-critical, and guarantees must be made to ensure no unsafe configurations occur. Hamilton-Jacobi (HJ) reachability is ideal for analyzing such safety-critical systems; however, its direct application is limited…

Multiagent Systems · Computer Science 2017-06-09 Somil Bansal , Mo Chen , Jaime F. Fisac , Claire J. Tomlin

Road safety continues to be a pressing global issue, with vehicle collisions imposing significant human, societal, and economic burdens. Human-machine shared collision avoidance in critical collision scenarios aims to aid drivers' accident…

Robotics · Computer Science 2025-09-03 Shiyue Zhao , Junzhi Zhang , Rui Zhou , Neda Masoud , Jianxiong Li , Helai Huang , Shijie Zhao

Within a robot autonomy stack, the planner and controller are typically designed separately, and serve different purposes. As such, there is often a diffusion of responsibilities when it comes to ensuring safety for the robot. We propose…

Robotics · Computer Science 2020-08-04 Xinrui Wang , Karen Leung , Marco Pavone

Hamilton Jacobi (HJ) Reachability is a formal verification tool widely used in robotic safety analysis. Given a target set as unsafe states, a dynamical system is guaranteed not to enter the target under the worst-case disturbance if it…

Optimization and Control · Mathematics 2020-03-18 Anjian Li , Mo Chen

It is well known that time dependent Hamilton-Jacobi-Isaacs partial differential equations (HJ PDE), play an important role in analyzing continuous dynamic games and control theory problems. An important tool for such problems when they…

Optimization and Control · Mathematics 2016-05-09 Jérôme Darbon , Stanley Osher

A classic reachability problem for safety of dynamic systems is to compute the set of initial states from which the state trajectory is guaranteed to stay inside a given constraint set over a given time horizon. In this paper, we leverage…

Probabilistic guarantees of safety and performance are important in constrained dynamical systems with stochastic uncertainty. We consider the stochastic reachability problem, which maximizes the probability that the state remains within…

Optimization and Control · Mathematics 2020-12-01 Abraham P. Vinod , Meeko M. K. Oishi