171 citations · 1.1k across the 134 of their papers we have counts for
Showing 2018 · cs.AIShow all
2 papers · 2 filters
cs.AI2018★ 1 cited
Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-sum Objectives
Krishnendu Chatterjee, Adrián Elgyütt, Petr Novotný +1
Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncer…
cs.AI2018
Graph Planning with Expected Finite Horizon
Krishnendu Chatterjee, Laurent Doyen
Graph planning gives rise to fundamental algorithmic questions such as shortest path, traveling salesman problem, etc. A classical problem in discrete planning is to consider a wei…