Learning Control Policies to Provably Satisfy Hard Affine Constraints for Black-Box Hybrid Dynamical Systems
Aayushi Shrivastava, Kartik Nagpal, Sairam Jinkala, Jean-Baptiste Bouvier, and Negar Mehr

TL;DR
This paper proposes a method to learn reinforcement learning policies that provably satisfy safety constraints in black-box hybrid dynamical systems by enforcing affine and repulsive policies near constraint boundaries.
Contribution
It introduces a novel approach that guarantees safety in unknown hybrid systems by constraining RL policies to be affine and repulsive near boundaries, accounting for state jumps.
Findings
The method guarantees safety constraints are satisfied in closed loop.
It outperforms reward shaping and learned-CBF methods in experiments.
The approach learns higher quality policies while ensuring safety.
Abstract
Ensuring safety for black-box hybrid dynamical systems presents significant challenges due to their instantaneous state jumps and unknown explicit nonlinear dynamics. Existing solutions for strict safety constraint satisfaction, like control barrier functions (CBFs) and reachability analysis, rely on direct knowledge of the dynamics. Similarly, safe reinforcement learning (RL) approaches often rely on known system dynamics or merely discourage safety violations through reward shaping. In this work, we want to learn RL policies which provably satisfy affine state constraints in closed loop for black-box hybrid dynamical systems with affine reset maps. Our key insight is forcing the RL policy to be affine and repulsive near the constraint boundaries for the unknown nonlinear dynamics of the system, providing guarantees that the trajectories will not violate the constraint. We further…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
