9 search results - page 1 / 2 » Local Search Topology in Planning Benchmarks: An Empirical A... |
IJCAI
2001
13 years 6 months ago
2001
Many state-of-the-art heuristic planners derive their heuristic function by relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. ...
JAIR
2011
2011
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
12 years 7 months ago
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic ...
AIPS
2004
13 years 6 months ago
2004
LPG is a planner that performed very well in the last International planning competition (2002). The system is based on a stochastic local search procedure, and it incorporates se...
JAR
2000
13 years 4 months ago
2000
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
AIPS
2011
12 years 8 months ago
2011
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work (Hoffmann 2005), it was observed that the optimal relax...