Probabilistic Reachability and Invariance Computation of Stochastic Systems using Linear Programming
We consider the safety evaluation of discrete time, stochastic systems over a finite horizon. Therefore, we discuss and link probabilistic invariance with reachability as well as reach-avoid problems. We show how to efficiently compute these quantities using dynamic and linear programming.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Probabilistic Reachability of Discrete-Time Nonlinear Stochastic Systems
In this paper we study the reachability problem for discrete-time nonlinear stochastic systems. Our goal is to present a unified framework for calculating the probabilistic reachable set of discrete-time systems in the p…
Myopically Verifiable Probabilistic Certificates for Safe Control and Learning
This paper addresses the design of safety certificates for stochastic systems, with a focus on ensuring long-term safety through fast real-time control. In stochastic environments, set invariance-based methods that restr…
Decision MakingSafe Control for Nonlinear Systems with Stochastic Uncertainty via Risk Control Barrier Functions
Guaranteeing safety for robotic and autonomous systems in real-world environments is a challenging task that requires the mitigation of stochastic uncertainties. Control barrier functions have, in recent years, been wide…
Data-Driven Reachability Analysis of Stochastic Dynamical Systems with Conformal Inference
We consider data-driven reachability analysis of discrete-time stochastic dynamical systems using conformal inference. We assume that we are not provided with a symbolic representation of the stochastic system, but inste…
Probabilistic Reachability Analysis of Stochastic Control Systems
We address the reachability problem for continuous-time stochastic dynamic systems. Our objective is to present a unified framework that characterizes the reachable set of a dynamic system in the presence of both stochas…