Research map / Probabilistic and scientific modeling / Dynamical systems
Runtime Safety and Reach-avoid Prediction of Stochastic Systems via Observation-aware Barrier Functions
Shenghua Feng, Jie An, Fanjiang Xu
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| add 5 runtime observations | observation-aware barrier bounds · osc (safety) | probability lower bound: 0.436 -> 0.873 | Improved |
| add 5 runtime observations | observation-aware barrier bounds · descent (safety) | probability lower bound: 0.704 -> 0.124 | Hurt |
| add 5 runtime observations | observation-aware barrier bounds · vanderpol-2 (safety) | probability lower bound: 0.158 -> 0.567 | Improved |
| add 5 runtime observations | observation-aware barrier bounds · vanderpol-1 (safety) | probability lower bound: 0.343 -> 0.227 | Mixed |
| add 5 runtime observations | observation-aware barrier bounds · equil (reach-avoid) | probability lower bound: 0.357 -> 0.087 | Hurt |
| add 5 runtime observations | observation-aware barrier bounds · arch (safety) | probability lower bound: 0.813 -> 0.574 | Hurt |
| add 5 runtime observations | observation-aware barrier bounds · liederivative (safety) | probability lower bound: 0.246 -> 0.056 | Hurt |
| add 5 runtime observations | observation-aware barrier bounds · lyapunov (safety) | probability lower bound: 0.226 -> 0.308 | Mixed |
| add 5 runtime observations | observation-aware barrier bounds · lotka (safety) | probability lower bound: 0.504 -> 0.963 | Improved |
| use online backward iteration with precomputed offline barrier instead of offline synthesis | observation-aware barrier bounds · lotka (computation time) | probability lower bound: 14.96s -> 0.02s | Improved |
| use online backward iteration with precomputed offline barrier instead of offline synthesis | observation-aware barrier bounds · liederivative (computation time) | probability lower bound: 6.80s -> 0.01s | Improved |
| add more observations | online update time · arch (computation time) | probability lower bound: 0.01s -> 0.51s | Mixed |
Closest papers by meaning
- Safely Learning Controlled Stochastic Dynamics (NeurIPS 2025 · similarity 0.88)
- A Physics-Informed Machine Learning Framework for Safe and Optimal Control of Autonomous Systems (ICML 2025 · similarity 0.86)
- Robust Active Measuring under Model Uncertainty (AAAI 2024 · similarity 0.85)
- Finite Sample Analyses for Continuous-time Linear Systems: System Identification and Online Control (NeurIPS 2025 · similarity 0.84)
- Learning Safe Control via On-the-Fly Bandit Exploration (ICML 2025 · similarity 0.84)
- Probabilistic Shielding for Safe Reinforcement Learning (AAAI 2025 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
