3 citations · 9 across the 10 of their papers we have counts for
Showing 2014 · cs.AIShow all
2 papers · 2 filters
cs.AI2014
Optimal Cost Almost-sure Reachability in POMDPs
Krishnendu Chatterjee, Martin Chmelík, Raghav Gupta +1
We consider partially observable Markov decision processes (POMDPs) with a set of target states and every transition is associated with an integer cost. The optimization objective…
cs.AI2014
POMDPs under Probabilistic Semantics
Krishnendu Chatterjee, Martin Chmelik
We consider partially observable Markov decision processes (POMDPs) with limit-average payoff, where a reward value in the interval [0,1] is associated to every transition, and the…