179 search results - page 19 / 36 » Using Classical Planners to Solve Nondeterministic Planning ... |
107
click to vote
ECAI
2008
Springer
15 years 3 months ago
2008
Springer
We introduce a simple variation of the additive heuristic used in the HSP planner that combines the benefits of the original additive heuristic, namely its mathematical formulation...
118
click to vote
CP
2010
Springer
15 years 14 days ago
2010
Springer
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
115
click to vote
JAIR
2011
14 years 8 months ago
2011
Markovian processes have long been used to model stochastic environments. Reinforcement learning has emerged as a framework to solve sequential planning and decision-making proble...
111
click to vote
AIPS
2009
15 years 3 months ago
2009
Solving real-world problems using symbolic planning often requires a simplified formulation of the original problem, since certain subproblems cannot be represented at all or only...
109
click to vote
JAIR
2006
15 years 1 months ago
2006
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). Our approach combines first-order state abstraction that avoids evaluating stat...