no code implementations • 24 Feb 2016 • Tomáš Brázdil, Krishnendu Chatterjee, Martin Chmelík, Anchit Gupta, Petr Novotný
Finally, we show experimentally that our algorithm performs well and computes succinct policies on a number of POMDP instances from the literature that were naturally enhanced with energy levels.
no code implementations • 14 Nov 2014 • Krishnendu Chatterjee, Martin Chmelík, Raghav Gupta, Ayush Kanodia
We consider partially observable Markov decision processes (POMDPs) with a set of target states and every transition is associated with an integer cost.
no code implementations • 22 Aug 2013 • Krishnendu Chatterjee, Martin Chmelík
We consider two types of path constraints: (i) quantitative constraint defines the set of paths where the payoff is at least a given threshold {\lambda} in (0, 1]; and (ii) qualitative constraint which is a special case of quantitative constraint with {\lambda} = 1.
