SOURCE-LINKED INTELLIGENCE

Quantitative Analysis of $ω$-Regular Robust MDPs

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

Robust Markov Decision Processes (RMDPs) generalize classical MDPs by allowing uncertainty in transition probabilities and optimizing against their worst-case realization. We consider $(s,a)$-rectangular RMDPs with \emph{linearly defined} uncertainty sets and study parity objectives, which are a canonical representation of $ω$-regular objectives. An uncertainty set is linearly defined if it is described by linear inequalities over the transition distribution together with auxiliary variables, which capture the standard $L_1$ and $L_\infty$ balls as well as general polytopic uncertainty sets. T

Read original source ↗ Open in workspace

recordType

paper

region

Global