Robust almost-sure reachability in multi-environment MDPs

DOI10.1007/978-3-031-30823-9_26zbMath1543.68233MaRDI QIDQ6535373

Marck van der Vegt, Nils Jansen, Sebastian Junges

Publication date: 13 December 2023

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planning and acting in partially observable stochastic domains
• Optimal cost almost-sure reachability in POMDPs
• What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives
• The complexity of two-player games of incomplete information
• On the undecidability of probabilistic planning and related stochastic optimization problems
• Enforcing almost-sure reachability in POMDPs
• Verification and control of partially observable probabilistic systems
• Computation of weighted sums of rewards for concurrent MDPs
• Modeling role-based systems with exogenous coordination
• Inductive synthesis for probabilistic programs reaches new horizons
• One net fits all. A unifying semantics of dynamic fault trees using GSPNs
• What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives.
• Multiple-environment Markov decision processes
• Verification of Markov Decision Processes Using Learning Algorithms
• Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions
• Robust Markov Decision Processes
• Computer Science Logic
• Probabilistic ω-automata
• Stochastic Games
• On the Complexity of Reachability in Parametric Markov Decision Processes
• A Survey of Zero-shot Generalisation in Deep Reinforcement Learning
• Convex Optimization for Parameter Synthesis in MDPs
• Parameter-Independent Strategies for pMDPs via POMDPs
• Verification of Indefinite-Horizon POMDPs

This page was built for publication: Robust almost-sure reachability in multi-environment MDPs