no code implementations • 23 Jan 2014 • Carmel Domshlak, Erez Karpas, Shaul Markovitch
A description of a planning task consists of an initial world state, a goal, and a set of actions for modifying the world state.
no code implementations • 16 Jan 2014 • Michael Katz, Carmel Domshlak
Indeed, some of the power of the explicit abstraction heuristics comes from precomputing the heuristic function offline and then determining h(s) for each evaluated state s by a very fast lookup in a database.
no code implementations • 15 Jan 2014 • Maxim Binshtok, Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony
For example, preferences over the content of an online newspaper should have this form: At each viewing, the newspaper contains a subset of the set of articles currently available.
no code implementations • 26 Sep 2013 • 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 rather poor worst-case guarantees on performance improvement over time.