Optimal cost almost-sure reachability in POMDPs

DOI10.1016/j.artint.2016.01.007zbMath1351.68307arXiv1411.3880OpenAlexW288011047MaRDI QIDQ253969

Raghav Gupta, Krishnendu Chatterjee, Ayush Kanodia, Martin Chmelík

Publication date: 8 March 2016

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.3880

zbMATH Keywords

approximation algorithmsPOMPDsreachability objectivestotal cost

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40) Approximation algorithms (68W25)

Related Items (7)

Runtime monitors for Markov decision processes ⋮ Enforcing almost-sure reachability in POMDPs ⋮ Parameter-Independent Strategies for pMDPs via POMDPs ⋮ Verification and control of partially observable probabilistic systems ⋮ Multi-cost bounded tradeoff analysis in MDP ⋮ Task-Aware Verifiable RNN-Based Policies for Partially Observable Markov Decision Processes ⋮ Optimal cost almost-sure reachability in POMDPs

Uses Software

• PRISM

Cites Work

• Planning and acting in partially observable stochastic domains
• Optimal cost almost-sure reachability in POMDPs
• On the undecidability of probabilistic planning and related stochastic optimization problems
• Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
• Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition
• The Complexity of Markov Decision Processes
• Biological Sequence Analysis
• The complexity of probabilistic verification
• Probabilistic automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal cost almost-sure reachability in POMDPs