10 citations · 13 across the 4 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2013★ 10 cited
Monte-Carlo Planning: Theoretically Fast Convergence Meets Practical Efficiency
Zohar Feldman, Carmel Domshlak
Popular Monte-Carlo tree search (MCTS) algorithms for online planning, such as epsilon-greedy tree search and UCT, aim at rapidly identifying a reasonably good action, but provide…
cs.AI2012★ 3 cited
Simple Regret Optimization in Online Planning for Markov Decision Processes
Zohar Feldman, Carmel Domshlak
We consider online planning in Markov decision processes (MDPs). In online planning, the agent focuses on its current state only, deliberates about the set of possible policies fro…