Set-valued MDP abstractions satisfy the vanishing ambiguity condition for asymptotic optimality and algorithm completeness, while interval MDP abstractions do not.
Robust control of uncertain markov decision processes with temporal logic specifications,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Optimality of Uncertain MDP Abstractions
Set-valued MDP abstractions satisfy the vanishing ambiguity condition for asymptotic optimality and algorithm completeness, while interval MDP abstractions do not.