226 search results - page 13 / 46 » Heuristic Search Planning with BDDs |
AIPS
2008
13 years 9 months ago
2008
Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST...
ASE
2006
13 years 7 months ago
2006
The structured programming literature provides methods and a wealth of heuristic knowledge for guiding the construction of provably correct imperative programs. We investigate the...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We investigate planning for self-interested agents in large multi-agent simulations. We present two heuristic algorithms that exploit different domain-specific properties in order...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...
AIPS
2008
13 years 9 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...