32 search results - page 2 / 7 » A Lookahead Strategy for Heuristic Search Planning |
JAIR
2006
13 years 4 months ago
2006
Real-time search methods are suited for tasks in which the agent is interacting with an initially unknown environment in real time. In such simultaneous planning and learning prob...
JAIR
2011
12 years 12 months ago
2011
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
NIPS
2007
13 years 6 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
ECAI
2004
Springer
13 years 10 months ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
CP
2010
Springer
13 years 3 months 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...