arXiv (All)
open access
Solving Robust POMDPs with Omega-regular Objectives via Partially Observable Stochastic Games
Robust POMDPs (RPOMDPs) generalize classical POMDPs to the setting where exact transition probabilities are not known -- rather, they are only known to belong to some uncertainty set of values. In this work, we study the problem of solving RPOMDPs with general omega-regular objectives, which subsume
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
- Learning Infinite-Horizon Average-Reward CMDPs via State Augmentation#1144060
- BayesianKAN: A reaction condition optimization framework integrating Kolmogorov-Arnold network and Bayesian optimization.#436995
- Statistical Reinforcement Learning - Modern Machine Learning Approaches.#489461
- Koopman-Assisted Reinforcement Learning#189179
- Koopman-Assisted Reinforcement Learning#189129
Record · ID 1141632
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