POMDPs under probabilistic semantics

DOI10.1016/j.artint.2014.12.009zbMath1329.90158arXiv1408.2058MaRDI QIDQ2344358

Krishnendu Chatterjee, Martin Chmelík

Publication date: 15 May 2015

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.2058

zbMATH Keywords

POMDPs; almost-sure winning; limit-average objectives

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C40: Markov and semi-Markov decision processes

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Uses Software

• POMDP