Data-Driven Abstraction and Synthesis for Stochastic Systems with Unknown Dynamics
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:EYGQWK2Trecord.jsonopen to challenge →
read the original abstract
We study the automated abstraction-based synthesis of correct-by-construction control policies for stochastic dynamical systems with unknown dynamics. Our approach is to learn an abstraction from sampled data, which is represented in the form of a finite Markov decision process (MDP). In this paper, we present a data-driven technique for constructing finite-state interval MDP (IMDP) abstractions of stochastic systems with unknown nonlinear dynamics. As a distinguishing and novel feature, our technique only requires (1) noisy state-input-state observations and (2) an upper bound on the system's Lipschitz constant. Combined with standard model-checking techniques, our IMDP abstractions enable the synthesis of policies that satisfy probabilistic temporal properties (such as "reach-while-avoid") with a predefined confidence. Our experimental results show the effectiveness and robustness of our approach.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
On the Optimality of Uncertain MDP Abstractions
Set-valued MDP abstractions satisfy the vanishing ambiguity condition for asymptotic optimality and algorithm completeness, while interval MDP abstractions do not.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.