כתבה
arXiv cs.AI ·
פתרון RPOMDPs עם יעדים Omega-regular דרך משחקים סטוכסטיים חלקית נראים
Solving Robust POMDPs with Omega-regular Objectives via Partially Observable Stochastic Games
ניתוח חדש: פתרון RPOMDPs עם יעדים Omega-regular דרך משחקים סטוכסטיים חלקית נראים. חידושים בפתרון RPOMDPs ו-RMDPs.
תקציר מקורי באנגליתarXiv:2608.24986v2 Announce Type: replace Abstract: 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 games (POSGs) under omega-regular objectives. Moreover, we show for the first time that reductions can be constructed in both directions, establishi
קרא במקור המקורי
arxiv.org
פתח כתבה מקורית