ISTA Publications
metadata only
Limit-sure reachability for small memory policies in POMDPs is NP-complete
A standard model that arises in several applications in sequential decision-making is partially observable Markov decision processes (POMDPs) where a decision-making agent interacts with an uncertain environment. A basic objective in POMDPs is the reachability objective, where given a target set of
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Q-Learning for Reachability in MEC-Free MDPs#1157052
- Model-Based Learning of Near-Optimal Finite-Window Policies in POMDPs#670543
- Model-Based Learning of Near-Optimal Finite-Window Policies in POMDPs#668478
- Learning Chance-Constrained MDPs with Bellman Distributional Certificates#1105415
- Lower bound on Howard policy iteration for deterministic Markov Decision Processes#1066570
Record · ID 1066571
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive