Failing with Grace: Learning Neural Network Controllers that are Boundedly Unsafe
Not on the map. Why?
Abstract (arXiv)
In this work, we consider the problem of learning a feed-forward neural network controller to safely steer an arbitrarily shaped planar robot in a compact and obstacle-occluded workspace. Unlike existing methods that depend strongly on the density of data points close to the boundary of the safe state space to train neural network controllers with closed-loop safety guarantees, here we propose an alternative approach that lifts such strong assumptions on the data that are hard to satisfy in practice and instead allows for graceful safety violations, i.e., of a bounded magnitude that can be spatially controlled. To do so, we employ reachability analysis techniques to encapsulate safety constraints in the training process. Specifically, to obtain a computationally efficient over-approximation of the forward reachable set of the closed-loop system, we partition the robot's state space into cells and adaptively subdivide the cells that contain states which may escape the safe set under the trained control law. Then, using the overlap between each cell's forward reachable set and the set of infeasible robot configurations as a measure for safety violations, we introduce appropriate terms into the loss function that penalize this overlap in the training process. As a result, our method can learn a safe vector field for the closed-loop system and, at the same time, provide worst-case bounds on safety violation over the whole configuration space, defined by the overlap between the over-approximation of the forward reachable set of the closed-loop system and the set of unsafe states. Moreover, it can control the tradeoff between computational complexity and tightness of these bounds. Our proposed method is supported by both theoretical results and simulation studies.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 33 references that are in the map. First posted on arXiv 22 Jun 2021.
Builds on
21 of 33 references.
References · 21
- 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 744
- 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 445
- 2019End-to-End Safe Reinforcement Learning through Barrier Functions for Safety-Critical Continuous Control Taskscited by 289
- 2019Towards Stable and Efficient Training of Verifiably Robust Neural Networkscited by 205
- 2017A General Safety Framework for Learning-Based Control in Uncertain Robotic Systemscited by 163
- 2017Socially Aware Motion Planning with Deep Reinforcement Learningcited by 136
- 2018Reachability Analysis of Deep Neural Networks with Provable Guaranteescited by 93
- 2020Learning Control Barrier Functions from Expert Demonstrationscited by 92
- 2017Output Reachable Set Estimation and Verification for Multi-Layer Neural Networkscited by 80
- 2020Reach-SDP: Reachability Analysis of Closed-Loop Systems with Neural Network Controllers via Semidefinite Programmingcited by 43
- 2020Reachable Set Estimation for Neural Network Control Systems: A Simulation-Guided Approachcited by 36
- 2018Variational End-to-End Navigation and Localizationcited by 34
9 more
- 2017Output Range Analysis for Deep Neural Networkscited by 30
- 2019ReachNN: Reachability Analysis of Neural-Network Controlled Systemscited by 26
- 2020Learning Hybrid Control Barrier Functions from Datacited by 24
- 2019Temporal Logic Guided Safe Reinforcement Learning Using Control Barrier Functionscited by 21
- 2018Barrier-Certified Adaptive Reinforcement Learning with Applications to Brushbot Navigationcited by 18
- 2019An Efficient Reachability-Based Framework for Provably Safe Autonomous Navigation in Unknown Environmentscited by 18
- 2019ART: Abstraction Refinement-Guided Training for Provably Correct Neural Networkscited by 14
- 2021Provably Correct Training of Neural Network Controllers Using Reachability Analysiscited by 5
- 2019Generating Robust Supervision for Learning-Based Visual Navigation Using Hamilton-Jacobi Reachabilitycited by 4
Built on by
Not cited yet.