4 search results - page 1 / 1 » Unifying the Causal Graph and Additive Heuristics |
AIPS
2008
13 years 7 months ago
2008
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
AIPS
2008
13 years 7 months ago
2008
We consider a generalization of the PDB homomorphism abstractions to what is called "structural patterns". The bais in abstracting the problem in hand into provably trac...
AIPS
2008
13 years 7 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...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...