Probabilistic Reach-Avoid Computation for Partially Degenerate Stochastic Processes

DOI10.1109/TAC.2013.2273300zbMATH Open1360.93656MaRDI QIDQ2983282FDOQ2983282

Authors: Sadegh Esmaeil Zadeh Soudjani, Alessandro Abate 

Publication date: 16 May 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Numerical solutions to stochastic differential and integral equations (65C30) Attainable sets, reachability (93B03) Discrete-time control/observation systems (93C55) Stochastic systems in control theory (general) (93E03)

Cited In (9)

• The Reach-Avoid Problem for Constant-Rate Multi-mode Systems
• Optimal retention of the trajectories of a discrete-time stochastic system in a tube: one problem statement
• Probabilistic reach-avoid for Bayesian neural networks
• The stochastic reach-avoid problem and set characterization for diffusions
• Probabilistic reach-avoid problems in nondeterministic systems with time-varying targets and obstacles
• Automated verification and synthesis of stochastic hybrid systems: a survey
• Stochastic reachability of a target tube: theory and computation
• SySCoRe: Synthesis via Stochastic Coupling Relations
• Dynamic Bayesian networks for formal verification of structured stochastic processes

This page was built for publication: Probabilistic Reach-Avoid Computation for Partially Degenerate Stochastic Processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983282)