AIIC AI Intelligence Centre

SOURCE-LINKED INTELLIGENCE

Solving Robust POMDPs with Omega-regular Objectives via Partially Observable Stochastic Games

arXiv · AI, language, vision and robotics · article · Aug 25, 2026 · UTC

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 a broad class of objectives such as reachability, safety, and linear temporal logic (LTL) objectives. We show that, for (s,a)-rectangular RPOMDPs with polytopic uncertainty sets, the problem of solving RPOMDPs under omega-regular objectives can be reduced to solving partially observable stochastic

Read original source ↗ Open in workspace

recordType
paper
region
Global

Evidence & attribution

First collected: 2026-09-21T09:42:05.193Z. This is not the publication date.